More actions
| rMMn DS | |
| File:Rmmnds.jpg | |
| General | |
|---|---|
| Author(s) | mincemeatteam |
| Type | Other |
| Version | 2.12.2 |
| Licence | Mixed |
| Links | |
| [Media:Rmmn2122ds.zip Download] | |
| Website | |
<htmlet>adsense</htmlet>
rMMnDS is a program to calculate shortest path program for the metro's net of Madrid.
Implemented the algorithms for the shortest route between two subway stations, allowing you to search a station by name.
User guide
rMMnDS, in the second version, also includes the suburban train network, allowing each network to select either individually or use the search and the calculation of shortest paths functions on both networks simultaneously.
It allows us to calculate the shortest route from one point to another for the Metro de Madrid, also searchable by name. In the latest version, we also have available the Madrid commuter network.
Changelog
'Version 2.12.2
- In this new version we believe we have managed to improve quite heuristics to take into account the number of stops and transfer between two stations.
- In addition to including in the initial screen, the ability to set the penalty against transshipment stops.
- In addition to correcting some bugs that we detected.
Version 2.11.9 2011-10-05
- Added line near Madrid.