Home/ Questions/Q 435
Next
In Process

SIKSHAPATH Latest Questions

I'M ADMIN
  • 1
  • 1
Asked: 2021-10-17T16:47:16+05:30 In:

Consider the graph given below. Find the minimum spanning tree of this graph using (a) Prim’s algorithm, (b) Kruskal’s algorithm, and (c) Dijkstra’s algorithm

  • 1
  • 1
Consider the graph given below. Find the minimum spanning tree of this graph using (a) Prim’s algorithm, (b) Kruskal’s algorithm, and (c) Dijkstra’s algorithm

Consider the graph given below. Find the minimum spanning tree of this graph using (a) Prim’s algorithm, (b) Kruskal’s algorithm, and (c) Dijkstra’s algorithm

prim’s algorithm
Share

    2 Answers

    2. Sahithi
    3. Professor
      This answer was edited.

      Tap on Below attachment button to download worksheet

      Attachment

    Leave an answer

    You must login to add an answer.

    Need An Account,