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.
|
|
| Name: |
Dijkstra Implementation |
| Base name: |
dijkstra_implementat |
| Description: |
Find best route using the Dijkstra algorithm |
| Version: |
- |
| PHP version: |
5 |
| License: |
Artistic License |
| All time users: |
399 users |
| All time rank: |
5493 |
| Week users: |
1 user |
| Week rank: |
2173  |
| |
|
| 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 |
|
|
Stumble It!
Bookmark in del.icio.us
Browse all classes by 
Support forum (1)
Blog
Latest changes
User ratings
Files
