|
code
newsgroups
|
|||||||||||||||||||||||
|
|||||||||||||||||||||||
Public Transport Path Algorithms?Hi all,
Anybody has links or knowledge of shortest path(s) algorithms for use in public transport, with maybe source code in vb6? Thanks, Ivan Sounds like a job for recursion.
Show quote "Ivan Debono" <ivanm***@hotmail.com> wrote in message news:OPb3vguVFHA.2540@tk2msftngp13.phx.gbl... > Hi all, > > Anybody has links or knowledge of shortest path(s) algorithms for use in > public transport, with maybe source code in vb6? > > Thanks, > Ivan > > that's my feeling. I've already got a mutilated version of Dijkstra
working... but it doesn't do the job right till now :( Ivan Show quote "DR Barkley" <David.Bark***@L-3Com.com> schrieb im Newsbeitrag news:OSCLzmvVFHA.2172@tk2msftngp13.phx.gbl... > Sounds like a job for recursion. > > "Ivan Debono" <ivanm***@hotmail.com> wrote in message > news:OPb3vguVFHA.2540@tk2msftngp13.phx.gbl... > > Hi all, > > > > Anybody has links or knowledge of shortest path(s) algorithms for use in > > public transport, with maybe source code in vb6? > > > > Thanks, > > Ivan > > > > > > Not sure the version you have working but check out;
http://www.pscode.com/vb/scripts/ShowCode.asp?txtCodeId=37095&lngWId=1 Also, there are other samples on the site if you search for 'Shortest Path' -- Show quoteChris Hanscom - Microsoft MVP (VB) Veign's Resource Center http://www.veign.com/vrc_main.asp -- Read. Decide. Sign the petition to Microsoft. http://classicvb.org/petition/ "Ivan Debono" <ivanm***@hotmail.com> wrote in message news:eIwAgDwVFHA.2420@TK2MSFTNGP12.phx.gbl... > that's my feeling. I've already got a mutilated version of Dijkstra > working... but it doesn't do the job right till now :( > > Ivan > > "DR Barkley" <David.Bark***@L-3Com.com> schrieb im Newsbeitrag > news:OSCLzmvVFHA.2172@tk2msftngp13.phx.gbl... > > Sounds like a job for recursion. > > > > "Ivan Debono" <ivanm***@hotmail.com> wrote in message > > news:OPb3vguVFHA.2540@tk2msftngp13.phx.gbl... > > > Hi all, > > > > > > Anybody has links or knowledge of shortest path(s) algorithms for use in > > > public transport, with maybe source code in vb6? > > > > > > Thanks, > > > Ivan > > > > > > > > > > > > On Thu, 12 May 2005 16:48:07 +0200, Ivan Debono <ivanm***@hotmail.com> wrote:
> that's my feeling. I've already got a mutilated version of Dijkstra You might also google on "Minimum spanning tree" or "Traveling Salesman> working... but it doesn't do the job right till now :( > > Ivan > Problem." Exhaustive enumeration will ALWAYS work, and you can futz about with saving known paths and discarding unknown paths as soon as they prove longer than your known basepoint. |
|||||||||||||||||||||||