No edit summary |
No edit summary |
||
| Line 11: | Line 11: | ||
}} | }} | ||
rMMnDS is a homebrew application that can calculate the shortest route from one point to another for the Madrid Metro (Metro System). It implements the algorithms for the shortest route between two subway stations, and allow you to search a station by name. | rMMnDS (Spanish) is a homebrew application that can calculate the shortest route from one point to another for the Madrid Metro (Metro System). It implements the algorithms for the shortest route between two subway stations, and allow you to search a station by name. | ||
==User guide== | ==User guide== | ||
Revision as of 09:08, 26 May 2021
| 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 (Spanish) is a homebrew application that can calculate the shortest route from one point to another for the Madrid Metro (Metro System). It implements the algorithms for the shortest route between two subway stations, and allow you to search a station by name.
User guide
In the latest version, it also has the Cercanías Madrid network available. Calculations can be made within each individual network, or you can perform search between different networks (which takes into account of both the number of stops and transfers between 2 stations).
Changelog
Version 2.12.2 2012-04-15
- Managed to improve the heuristics a lot to take into account both the number of stops and transfers between 2 stations.
- Included the possibility of configuring this penalty for stops versus transfer.
- Corrected some bugs.
Version 2.11.9 2011-10-05
- Added the Madrid commuter line.