|Info||View files (3)||Download .zip||Reputation||Support forum (5)||Blog|
|Last Updated||Ratings||Unique User Downloads||Download Rankings|
|2004-06-02 (10 years ago)||56%||Total: 3,545||All time: 871 This week: 812|
|graph 1.0.0||GNU General Public Lice...||Algorithms, Geography, Math|
Prize: One copy of the Zend Studio
|Computing all possible routes between two points considering the different alternative directions that may be taken in the way has always been an interesting problem.
Depending on the purpose, different solutions may be found that are optimized to cost less in fuel consumed by a transportation vehicle, may take less time to traverse, or may just be a convenient alternative when one or more paths are blocked for some problem that may exist by the time the a certain route is being traversed.
This class provides a solution to compute all the different routes that may be taken to reach one point departing from another.
Although it does not solve a problem that is common in Web programming, it may be useful in specific situations where computing multiple routes is part of a solution of a more specific problem.
|Version Control||Unique User Downloads||Download Rankings|
|This week:||0||This week:||812|
|User Ratings||User Comments (1)|