Computer Science, asked by khadeeja4123, 4 days ago

Consider the graph given below. Find the minimum spanning tree of this graph using -
(a) prim's algorithm
(b) Kruskals algorithm
(c) dijkstra's algorithm

Answers

Answered by Annahyaanh60
1

Answer:

hope its helpful

Explanation:

(a)primes algorithm

Similar questions