| 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.
|
| Class and Description |
|---|
| Distance
An interface for classes which calculate the distance between
one vertex and another.
|
| Class and Description |
|---|
| Distance
An interface for classes which calculate the distance between
one vertex and another.
|
| Class and Description |
|---|
| DijkstraDistance
Calculates distances in a specified graph, using
Dijkstra's single-source-shortest-path algorithm.
|
| DijkstraDistance.SourceData
For a given source vertex, holds the estimated and final distances,
tentative and final assignments of incoming edges on the shortest path from
the source vertex, and a priority queue (ordered by estimated distance)
of the vertices for which distances are unknown.
|
| Distance
An interface for classes which calculate the distance between
one vertex and another.
|
| ShortestPath
An interface for algorithms that calculate shortest paths.
|
Copyright © 2016. All rights reserved.