Constructor and Description 

GraphMeasurer(Graph<V,E> graph)
Constructs a new instance of GraphMeasurer.

GraphMeasurer(Graph<V,E> graph,
ShortestPathAlgorithm<V,E> shortestPathAlgorithm)
Constructs a new instance of GraphMeasurer.

Modifier and Type  Method and Description 

double 
getDiameter()
Compute the diameter of the
graph.

Set<V> 
getGraphCenter()
Compute the graph center.

Set<V> 
getGraphPeriphery()
Compute the graph periphery.

Set<V> 
getGraphPseudoPeriphery()
Compute the graph pseudoperiphery.

double 
getRadius()
Compute the radius of the graph.

Map<V,Double> 
getVertexEccentricityMap()
Compute the eccentricity of
each vertex in the graph.

public GraphMeasurer(Graph<V,E> graph)
FloydWarshallShortestPaths
is used as the
default shortest path algorithm.graph
 input graphpublic GraphMeasurer(Graph<V,E> graph, ShortestPathAlgorithm<V,E> shortestPathAlgorithm)
graph
 input graphshortestPathAlgorithm
 shortest path algorithm used to compute shortest paths between
all pairs of vertices. Recommended algorithms are:
JohnsonShortestPaths
(Runtime complexity:
$O(VE + V^2 logV)$) or
FloydWarshallShortestPaths
(Runtime complexity:
$O(V^3)$.public double getDiameter()
Double.POSITIVE_INFINITY
.public double getRadius()
Double.POSITIVE_INFINITY
.public Map<V,Double> getVertexEccentricityMap()
Double.POSITIVE_INFINITY
. The
runtime complexity of this method is $O(n^2+L)$, where $L$ is the runtime complexity of the
shortest path algorithm provided during construction of this class.public Set<V> getGraphCenter()
public Set<V> getGraphPeriphery()
public Set<V> getGraphPseudoPeriphery()
Copyright © 2018. All rights reserved.