443,818 Members | 1,223 Online Need help? Post your question and get tips & solutions from a community of 443,818 IT Pros & Developers. It's quick & easy.

# Calculating Distance From Start Node - Dijkstra's Algorithm

 P: 2 Hello, I am having some trouble in working out the distance of each node from the starting node in my Dijkstra Algorithm code. Here is my code with the section i'm stuck on in bold: Expand|Select|Wrap|Line Numbers infinity = 1000000 invalid_node = -1 startNode = 0   class Node:      distFromSource = infinity      previous = invalid_node      visited = False   def populateNodeTable():      nodeTable = []     index =0     f = open('route.txt', 'r')     for line in f:        node = map(int, line.split(','))        nodeTable.append(Node())        print nodeTable[index].previous        print nodeTable[index].distFromSource        index +=1     nodeTable[startNode].distFromSource = 0        return nodeTable   def tentativeDistance(currentNode, nodeTable):     nearestNeighbour = []     for currentNode in nodeTable: #         if Node[currentNode].distFromSource +       currentDistance = startNode + currentNode #      currentDistance = currentNode.distFromSource + nodeTable.currentNode           currentNode.previous = currentNode          currentNode.length = currentDistance          currentNode.visited = True          currentNode +=1          nearestNeighbour.append(currentNode)          print nearestNeighbour       return nearestNeighbour   currentNode = startNode   if __name__ == "__main__":     populateNodeTable()     tentativeDistance(currentNode,populateNodeTable()) I've no idea on where I am going wrong, i've tried a few things now but nothing seems to work Mar 8 '11 #1 