Dijkstra-algorithm in basic
  
|
Works with a little help..
by Benny Olsson
, Malmö, Sweden, on Tuesday Jul 17, 2001
|
First of all.. This piece of code is written in vb3, so the first thing I had to do was to convert it into vb 6 standard..
Not so hard though..
But when I try ro run it i run into some problems.. the author has added a part to the algorithm that is supposed to retreive the names of the nodes needed to "visit" on the lowest cost path to the target.
Well.. It sounds great in theory.. Too bad it doesn't work.
Well.. It does work a bit.. If the goal node is located "higher" in the array then the start node, then it'll find it, but if you've got a graph with the following connections:
a -> b, b -> c, c -> a
then it won't find the path between c and a. It just hangs..
But with some tweaking you might get it to work.. At least I did.
Reply To this Post Report as abusive.
| |
|
Good starting-point
by Mike Wittenburg, London, on Thursday Apr 11, 2002
|
This code works well as a guide to how it could work. Code definitely need work though. Another problem in addition to those listed above is that it bombs when your start node isn't the first instance of the array.
So, as mentioned, if you need a point of departure it serves as a base, but it doesn't work in a real-world scenario. The Java demo available online is a better example.
Reply To this Post Report as abusive.
| |
| |
Dijkstra Algorithm in Visual Basic 6.0
by Clarence Lee
, Kota Kinabalu, Sabah, Malaysia, on Saturday Dec 23, 2006
|
Dear all,
I'm an undergraduate student from Universiti Malaysia Sabah and now I am undergoing with a dissertation project which related to Dijkstra Algorithm with using Visual Basic 6.0. So, could anyone try to convert the coding from Visual Basic 3.0 to Visual Basic 6.0? It is because I never learn about Visual Basic 3.0. I wish there is somebody who are willing to help me. My email address is clairy_lee@yahoo.com. I am looking forward from you and thank you in advance.
Reply To this Post Report as abusive.
| |
|
