![]() |
Satsuma
a delicious .NET graph library
|
Go to the source code of this file.
Classes | |
| class | Satsuma.Dijkstra |
| Uses Dijkstra's algorithm to find cheapest paths in a graph. More... | |
Namespaces | |
| package | Satsuma |
Enumerations | |
| enum | Satsuma.DijkstraMode { Satsuma.Sum, Satsuma.Maximum } |
| The path cost calculation mode for Dijkstra's algorithm. More... | |
1.8.3.1