Uses of Interface
edu.uci.ics.jung.algorithms.shortestpath.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.scoring Mechanisms for assigning values (denoting significance, influence, centrality, etc.) to graph elements based on topological properties.edu.uci.ics.jung.algorithms.shortestpath Provides interfaces and classes for calculating (geodesic) distances and shortest paths. -
-
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 Description protected Distance<V>
KKLayout. distance
Retrieves graph distances between vertices of the visible graphConstructors in edu.uci.ics.jung.algorithms.layout with parameters of type Distance Constructor Description 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.scoring
Fields in edu.uci.ics.jung.algorithms.scoring declared as Distance Modifier and Type Field 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 Description BarycenterScorer(Hypergraph<V,E> graph, Distance<V> distance)
Creates an instance with the specified graph and distance metric.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 tothis(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. -
Uses of Distance in edu.uci.ics.jung.algorithms.shortestpath
Classes in edu.uci.ics.jung.algorithms.shortestpath that implement Distance Modifier and Type Class Description class
DijkstraDistance<V,E>
Calculates distances in a specified graph, using Dijkstra's single-source-shortest-path algorithm.class
DijkstraShortestPath<V,E>
Calculates distances and shortest paths 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.shortestpath with parameters of type Distance Modifier and Type Method Description static <V,E>
com.google.common.base.Function<V,java.lang.Double>DistanceStatistics. averageDistances(Hypergraph<V,E> graph, Distance<V> d)
For each vertexv
ingraph
, calculates the average shortest path length fromv
to all other vertices ingraph
using the metric specified byd
, and returns the results in aMap
from vertices toDouble
values.static <V,E>
doubleDistanceStatistics. diameter(Hypergraph<V,E> g, Distance<V> d)
Returns the diameter ofg
using the metric specified byd
.static <V,E>
doubleDistanceStatistics. diameter(Hypergraph<V,E> g, Distance<V> d, boolean use_max)
Returns the diameter ofg
using the metric specified byd
.
-