Package | Description |
---|---|
edu.uci.ics.jung.algorithms.shortestpath |
Provides a set of algorithms for computing the shortest path between two nodes or between each pair of nodes in a graph.
|
edu.uci.ics.jung.statistics |
Provides a set of statistical tools for analyzing graphs.
|
edu.uci.ics.jung.visualization.contrib |
These are additional layouts contributed by various users.
|
Modifier and Type | Class and Description |
---|---|
class |
DijkstraDistance
Calculates distances in a specified graph, using
Dijkstra's single-source-shortest-path algorithm.
|
class |
DijkstraShortestPath
Calculates distances and shortest paths using Dijkstra's
single-source-shortest-path algorithm.
|
class |
UnweightedShortestPath
Computes the shortest path distances for graphs whose edges are not weighted (using BFS).
|
Modifier and Type | Method and Description |
---|---|
static java.util.Map |
GraphStatistics.averageDistances(ArchetypeGraph graph,
Distance 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 double |
GraphStatistics.diameter(ArchetypeGraph g,
Distance d)
Returns the diameter of
g using the metric
specified by d . |
static double |
GraphStatistics.diameter(ArchetypeGraph g,
Distance d,
boolean use_max)
Returns the diameter of
g using the metric
specified by d . |
Modifier and Type | Field and Description |
---|---|
protected Distance |
KKLayout.distance
Retrieves graph distances between vertices of the visible graph
|
Constructor and Description |
---|
KKLayout(Graph g,
Distance distance) |