Innovation Award
 April 2009
Number 5 |
Dijkstra algorithm is very popular to determine the best path to route packets of information sent over the Internet, but it can be used to the determine the best path to go through any type of network.
This class provides a pure PHP implementation of the Dijkstra algorithm
Manuel Lemos |
This class can be used to find the best route between two points using the Dijkstra algorithm.
It takes as parameters an array with all possible routes between to points and the start point.
The class can get the best path and the distance to each network point.
| Ratings | Utility |
Consistency |
Documentation |
Examples |
Tests |
Videos |
Overall |
Rank |
| All time: |
Good (83.3%) |
Sufficient (75.0%) |
- |
- |
- |
- |
Not sure (49.2%) |
1372 |
| Month: |
Not yet rated by the users |
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.