| Package | Description |
|---|---|
| org.protempa.graph |
| Class and Description |
|---|
| BellmanFord.Mode
For setting whether the Bellman-Ford algorithm should look for the
shortest paths from a source or to a destination.
|
| DirectedGraph
A directed graph implementation.
|
| Edge |
| Weight
Like a
Long except that there are special values representing
positive infinity, negative infinity, positive epsilon (smallest positive
value), and negative epsilon (smallest negative value). |
Copyright © 2012–2017 Emory University. All rights reserved.