I Am having problems using Dijkstra's algorithm to calculate path and distance from a favorite point to certain junctions. This is my code:
Code:
import dijkstra_epp

file_loc = 'join_intersect.txt'

# create the file handle
file = open(file_loc, 'r')

# put all lines from file in a list
lines = file.readlines()

# dump/pop the header row
header = lines.pop(0)

tokenlist
...