Algorithms: Dijkstra
Xu Yulei (contact me)
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.
| Utility
| Consistency
| Docs
| Examples
| Tests
| Videos
| Overall
| Rank
|
| Good (83.3%)
| Sufficient (75.0%)
| -
| -
| -
| -
| Not sure (49.2%)
| 1307 |
Click here for detailed information about this class on phpclasses.org
Php Handleiding