Input CSV Adjacency Matrix
Pseudocode
Dijkstra(G, s, t):
for each v in G.V - {s}:
v.dist = infinity
v.pred = null
v.seen = false
s.dist = 0
Q = {G.V}
while Q ≠ ∅:
u = Q.extractMin()
u.seen = true
for each v in G.adj(u):
alt = u.dist + weight(u -> v)
if (alt < v.dist):
v.dist = alt
v.pred = u