Extra exercise 1 The table below encodes a graph on the vertex set (a, b,c, d, e, f,g together with the weight of each edge from i to j. Missing entries indicate edges not in the graph. Apply Dijkstra’s algorithm to find the distance from the vertex a to any other vertex, and give a shortest path. (1 e524 2 5 22 2 Show transcribed image text Extra exercise 1 The
OR
OR