(a) Using the Dijkstra's algorithm to the graph, find the shortest paths from vertex 1 to other

Question

(a) Using the Dijkstra&#x27;s algorithm to the graph, find the shortest paths from vertex 1 to other

Sri K · Answer

Here in this question we are given this diagram and with the help of de jocatives method we have

Wen Zheng · Answer

So we need to extend the gesture algorithm as follows. So first do something, something, so here

Madhur L · Answer

Hello everyone, in the first part of the question we have to use Prim&#x27;s algorithm to find the mi

Steven Clarke · Answer

okay we&#x27;re using here prim&#x27;s algorithm and with prim you can start with any vertex but they tell

Wen Zheng · Answer

So we can assign a VIT 1 to each edge, then use a gesture algorithm.

(a) Using the Dijkstra's algorithm to the graph, find the shortest paths from vertex 1 to other vertices. (b) Find a shortest spanning tree by the Kruskal's algorithm.