This class can find best route using the Dijkstra algorithm.
There is an auxiliary class that encapsulates the functionality of a node through which a route may pass.
Links may be added between each node with the information of distance and whether there is a reciprocal link in the opposite direction.
The main class may the best routes between two nodes returning the information of the path nodes and associated costs.
| Not yet rated by the users |
| |
Applications that use this class |
|
|
No application links were specified for this class.

If you know an application of this package, send a message to the
author to add a link here.
| |
Files |
|
|