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;

8 - vertices

15- edges

6 4 0.93

4 5 0.25

5 4 0.35

4 7 0.37

5 7 0.28

7 5 0.28

5 1 0.32

0 4 0.38

0 2 0.26

7 3 0.39

1. 3 0.29

2. 7 0.34

6 2 0.40

3. 6 0.52

6 0 0.58