Dijkstras algorithm on each of them to find the Single Source Shortest Path within these graphs considering 0 as the source. Record the times required for each of these graphs. For ex: the text file is as follows: Find the minimum spanning tree and time taken to find that. Thanks in avance.

initialise_single_source( Graph g, Node s )

for each vertex v in Vertices( g )

d[v] := infinity

pi[v] := nil

d[s] := 0;