Well... If I can go all the way back to my JAVA days in CS, I used Linked List to Do Dijksta's algorithm. I found them much more easier to manage, but then some of that is just your own preference. Well linked list are or can be "expensive" as far as computational because... everytime you call
Object Foo = new Object();
you are "makeing" another place in memory. But the catch is this statement is not done until runtime. That means when you compile this it wont "do" this step until runtime. So yes, it does cost a bit more processing time, however if you are worried about processor overloading or computer crashing with too much data dont. With todays machines the cost isnt that bad. Good luck finding the shortest path.... But um... next time post this question to a JAVA news group not PHP. 🙂
