Uses of Interface
edu.uci.ics.jung.algorithms.path.Distance

Packages that use Distance

Package	Description
edu.uci.ics.jung.algorithms.layout	Algorithms for assigning 2D coordinates (typically used for graph visualizations) to vertices.
edu.uci.ics.jung.algorithms.path	Contains path classes for the layout packages.
edu.uci.ics.jung.algorithms.scoring	Contains scoring classes for the layout packages.

Uses of Distance in edu.uci.ics.jung.algorithms.layout

Fields in edu.uci.ics.jung.algorithms.layout declared as Distance

Modifier and Type	Field and Description
protected Distance<V>	KKLayout.distance Retrieves graph distances between vertices of the visible graph

Constructors in edu.uci.ics.jung.algorithms.layout with parameters of type Distance

Constructor and Description
KKLayout(Distance<V> distance) Creates an instance which does not initialize the vertex locations.
KKLayout(Graph<V,E> g, Distance<V> distance) Creates an instance for the specified graph and distance metric.

Uses of Distance in edu.uci.ics.jung.algorithms.path

Classes in edu.uci.ics.jung.algorithms.path that implement Distance

Modifier and Type	Class and Description
class	DijkstraDistance<V,E> Calculates distances in a specified graph, using Dijkstra's single-source-shortest-path algorithm.
class	UnweightedShortestPath<V,E> Computes the shortest path distances for graphs whose edges are not weighted (using BFS).

Methods in edu.uci.ics.jung.algorithms.path with parameters of type Distance

Modifier and Type	Method and Description
static <V,E> org.apache.commons.collections15.Transformer<V,java.lang.Double>	DistanceStatistics.averageDistances(Hypergraph<V,E> graph, Distance<V> d) For each vertex v in graph, calculates the average shortest path length from v to all other vertices in graph using the metric specified by d, and returns the results in a Map from vertices to Double values.
static <V,E> double	DistanceStatistics.diameter(Hypergraph<V,E> g, Distance<V> d) Returns the diameter of g using the metric specified by d.
static <V,E> double	DistanceStatistics.diameter(Hypergraph<V,E> g, Distance<V> d, boolean use_max) Returns the diameter of g using the metric specified by d.

Uses of Distance in edu.uci.ics.jung.algorithms.scoring

Fields in edu.uci.ics.jung.algorithms.scoring declared as Distance

Modifier and Type	Field and Description
protected Distance<V>	DistanceCentralityScorer.distance The metric to use for specifying the distance between pairs of vertices.

Constructors in edu.uci.ics.jung.algorithms.scoring with parameters of type Distance

Constructor and Description
ClosenessCentrality(Hypergraph<V,E> graph, Distance<V> distance) Creates an instance using the specified vertex/vertex distance metric.
DistanceCentralityScorer(Hypergraph<V,E> graph, Distance<V> distance, boolean averaging) Equivalent to this(graph, distance, averaging, true, true).
DistanceCentralityScorer(Hypergraph<V,E> graph, Distance<V> distance, boolean averaging, boolean ignore_missing, boolean ignore_self_distances) Creates an instance with the specified graph, distance metric, and averaging behavior.