Question

(g) Apply Dijkstra's Algorithm to find the distance from vertex 1 to every other vertex in the graph at left showing clearly the steps taken by the algorithm

Answer 1

Given graph Here first we are assuming that we present at outside of the network so, the distance from where we present and to each other unvisited node is infinity initially Later, we consider one node as visited and we find distance from that visited to other nodes that are connected to it. If any node is not connected to the visited node then take distance as infinity explanation of table: - we selected (1) nodes as the visited node and we find distance from that node (1) to each other nodes that are connected directly to it. As node (1) is not directly connected to node (5). So, infinity is the distance next we select the node (2) as it has the shortest distance and we find the distance to each other remaining nodes by adding (1) Rightarrow (2) distance to that following the procedure for all the \r\n remaining