Currently I have a GUI that takes in the paths and assigns them to a multi-tiered array(up to x) from the user, or alternatively(realistically) taking the array from a file input. The program then saves the weights in the element that corresponds to the nodes the path attaches to. I should note at this point the project doesn't need to be optimal, a multidimensional array seemed easiest to implement with the time given. The graphical representation basics are done as well using simple drawn lines and color changes to represent the paths, the nodes, reached paths, and optimal path.
On to the problem however, I understand how the algorithm works(basically) but I'm having trouble thinking of a way to implement it. I can't seem to think of a way to save an unknown number of paths or compare them step by step to the other possible paths. I'm looking for pointers, a shove in the right direction, or examples of code that is already implemented doing what I am looking for even if it's not doing Dijkstra's. If I'm way out in the wrong direction telling me a better place to be looking would be nice as well.
Thanks in advance for any advice given.
This post has been edited by Pyrokitsune: 20 May 2010 - 01:19 AM