Nov 8, 2009 at 11:25 AM
Edited Nov 8, 2009 at 11:32 AM
After a long time I finally got some time to verify this algo as I use in my railroad software 'LocCommander' . And I'm impressed with this algo I'm now able to determine all the paths between 2 points in my layout.
Thank you very much!
However, as a 'modelrailroad' layout can become a very large graph, I wonder if some improvements could be done so that the algo speeds up in finding all 'true' paths.
In the screenshot (please see the hyperlink below) you can see that when having a "triple switch" a lot of paths are possible although only a few paths(green) are really possible for a train to travel along. After the algo
has calculated all possible paths it is easy for me to filter out the good ones, but I wonder if in some way the algo could be modified so that it stops with determinating a path if certain conditions are forfilled that determine that a path is not usable.
Thus two successive edges having the same tag (the same triple switch) should not be investigated further... Could this be possible? Or should I use something different. In my current layout it can take up to 10 minutes (half Giga memory) to
calculate all paths between two points in the layout... The max value is set to 10000. For a small layout with a few switches it goes pretty well!