Uses of Interface
edu.uci.ics.jung.algorithms.shortestpath.Distance
Packages that use Distance
Package
Description
Algorithms for assigning 2D coordinates (typically used for graph visualizations)
to vertices.
Mechanisms for assigning values (denoting significance, influence, centrality, etc.)
to graph elements based on topological properties.
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 DistanceModifier and TypeFieldDescriptionKKLayout.distance
Retrieves graph distances between vertices of the visible graphConstructors in edu.uci.ics.jung.algorithms.layout with parameters of type Distance -
Uses of Distance in edu.uci.ics.jung.algorithms.scoring
Fields in edu.uci.ics.jung.algorithms.scoring declared as DistanceModifier and TypeFieldDescriptionDistanceCentralityScorer.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 DistanceModifierConstructorDescriptionBarycenterScorer
(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 DistanceModifier and TypeClassDescriptionclass
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
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 DistanceModifier and TypeMethodDescriptionstatic <V,
E> com.google.common.base.Function <V, 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> double DistanceStatistics.diameter
(Hypergraph<V, E> g, Distance<V> d) Returns the diameter ofg
using the metric specified byd
.static <V,
E> double DistanceStatistics.diameter
(Hypergraph<V, E> g, Distance<V> d, boolean use_max) Returns the diameter ofg
using the metric specified byd
.