What filename do you want to read? 
Vertices: a b c d e f s t 
Edges: 
a -> b: 24
b -> t: 19
b -> d: 2
c -> b: 6
c -> t: 6
d -> c: 11
d -> t: 16
e -> d: 30
e -> f: 5
e -> b: 18
f -> d: 20
f -> t: 44
s -> a: 9
s -> e: 14
s -> f: 15

Visiting s
  Updating dist[a] from 9999999 to 9.
  Updating dist[e] from 9999999 to 14.
  Updating dist[f] from 9999999 to 15.
Visiting a
  Updating dist[b] from 9999999 to 33.
Visiting e
  Updating dist[d] from 9999999 to 44.
  Updating dist[b] from 33 to 32.
Visiting f
  Updating dist[d] from 44 to 35.
  Updating dist[t] from 9999999 to 59.
Visiting b
  Updating dist[t] from 59 to 51.
  Updating dist[d] from 35 to 34.
Visiting d
  Updating dist[c] from 9999999 to 45.
  Updating dist[t] from 51 to 50.
Visiting c
Visiting t

Shortest path is:
s e b d t 
Distance is: 
50

Final dist map:
a: 9
b: 32
c: 45
d: 34
e: 14
f: 15
s: 0
t: 50

Final prev map:
a: s
b: e
c: d
d: b
e: s
f: s
s: 
t: d