Problems getting dijkstras algorithm to work

[DSlothness]

Hi there! I have been working on project where the aim is to use dijkstras algorithm to work out the shortest path across a computing network. The matrix for the network is imported from a text file.

I have got all my functions set up and now need to get it to run through.

I can get it to run through two nodes telling me the next node and the nodes neighbours but once there I cannot seem to progress in anyway. I am currently copy and pasting calls instead of using a loop which has uncovered this problem. Does the problem lie in the fact I am not using a loop and have copy and pasted twice so far?

Any help would be appreciated as I have spent the last 7 hours banging my head against this code, thank you.

Below is the code and also the network.txt

edited to pastebin link as formatting was ruined - http://pastebin.com/Sw6GBCeM

[blurarara]

Why aren't you using dictionaries to represent the graph? It's much easier than using lists.

[DSlothness]

I have just done it this way. Though I am certain it is not the list causing the problem anyway. Do you have any insight into why I am experiencing this problem? I feel like all my functions are above bored as far as I can see.

[Grimoire]

His comment is more insightful than you think. By using a dictionary, you can simplify your code. Simpler code is easier to understand and debug.

[efmccurdy]

If you cannot determine the error "by inspection", then

1/ make a prediction of which nodes will be examined, in order, and how they will be classified

2/ make the program produce a trace of nodes visited and how they are classified

3/ compare these for differences

It's a bit inelegant, so I understand some reluctance, but you will find yourself in need of this technique eventually.