Prim's Algorithm | Minimum Spanning tree | MST | DAA | Lec-26 | Bhanu Priya

Design & Analysis of Algorithms ( DAA )
Minimum Spanning tree(MST) : Prim's algorithm clear explanation with example

Class Notes ( pdf )

Complete DAA Course Playlist :

[kazimehrabrashid]

thank you madam, you explanation was very easy to understand. but i am afraid that at 12:05 'f' should be connected with 'e', you said that exactly though.

[prathyusha]

Guys - Prim's algorithm yields the minimum spanning tree only when there are unique edge weights. The way she explained is correct. However, for this graph (where there are 2 pairs of edges with the same weights bd, ac and bc, df), Kruskal's algorithm is the efficient one. She could have chosen to use unique edge weights. Kruskal's would give you 22 as many of you mentioned

[hemanthprabhu]

I have tomorrow exam and I searched for prims algorithm in many videos and still was confusing, this video opened accidentally but its the best pakka 7 marks 😅 thanks ma'am 😊

[afnainshariff]

Thanks mam u r the best teacher of youtube

[kondurivarun]

nice explanation keep rocking and inspire
many more

[pubalidas]

F should be connected to e. As it has minimum weight

[mithun]

Mam your my god for all the subjects because of u I will win and score good marks in my exam really thank you so much mam it means a lots 💓☺️☺️

[VishalAnandTM]

Minimum spanning tree has a weight of 22 whereas your tree is 23 ... i suppose you made a mistake . f should be connected to both e and g

[ishowertudu]

last connection would be between (f, e), not between (g, e).


Then the answer will be 22

[devratnasawaitul]

ans is wrong but got an idea how it actually work
thnk u 😇

[sattivideos]

The correct answer here is f to g and f to e not from g to e so that minimum spanning tree has weight of 22

[yogeshdharya]

For what reasons exactly will anyone dislike a crystal clear(in terms of explanation) video like this?

[Abdulsamad-]

Ma'am you can choose F to E also na?

[sumitkumarmishra]

I think your's example ans is wrong because at final step (e-f) will be connected not (e-g)

[pushkarroy]

1 NOTE : In last step the edges should be {f, e) and not {g, e}, because {f, e} has weight 5 which is less than 6 of {g, e}

[sachilandrew]

Mam said that second step is to select the unvisited vertex f is already visited vertex but e is the new vertex thats the reason for selecting (e, g)

[muhammadaamir]

last connection would be between (f, e), not between (g, e).


Then the answer will be 22 not 23

[aangyamishra]

Tq mam... For ur simply explanation... It made easy to understand this concept

[pushkarkumar]

At last e-f will be connected instead of g-e

[taleemmurtaza]

Amazing ma'am thoughts cleared thank you very much