Finding the shortest paths of a directed graph C/C++

Question

I have a graph.txt like this: 5 1 5 (a,b,3) (c,b,5) (b,d,2) (e,d,2) (e,d,6) (c,d,1) (b,e,9)

with the first line is number of vertices next is used to find the shortes