Package | Description |
---|---|
org.graphstream.algorithm |
Modifier and Type | Class and Description |
---|---|
class |
Dijkstra
Dijkstra's algorithm computes the shortest paths from a given node called
source to all the other nodes in a graph.
|
class |
Kruskal
Compute a spanning tree using the Kruskal algorithm.
|
class |
Prim
Compute a spanning tree using the Prim algorithm.
|