| Module Info
| Add a review of Map-Tube
At this early stage this distribution contains a unweighted, undirected, graph of the London Tube map (in Map::Tube::Node) and what seems to be a home brewed Single Destination Shortest Path-algorithm (in Map::Tupe::_process_node()) which is in turn used to solve the Single Pair Shortest Path-problem.
An interesting problem for a novice programmer, but is it really interesting to have on CPAN?
For real use I would look at Graph, Graph::Fast, or Boost::Graph (but I havn't tried any of then lately)
To the author: You really want to read about Dijkstra's algorithm en.wikipedia.org/wiki/Dijkstra's_algo... (or even better in any book about basic algorithms).