Prim's Algorithm for Minimum Spanning Tree | Graph Theory #13

preview_player
Показать описание
Prim's Algorithm for Minimum Spanning Tree. Kruskal's algorithm is explained in next video. This video explains about finding minimum spanning tree.
Рекомендации по теме
Комментарии
Автор

Sir, take respect from me, you are the real teacher in my eyes.. I have learned many things from you before my tests and assignments.
From Bangladesh 😊

nothing
Автор

Thiss pefect sir. Despite different language, i got you more than any teacher in Vietnam.

PoppingKhiem
Автор

Thank you for all your videos. They are incredibly well-made and provide a lot of information in a concise manner.

ridhimachauhan
Автор

This is the best lesson I have ever taken, dispite the different accent aroud the world(I am a Chinese youtube user), the knowledge itself is very valuable.

sheldon
Автор

Very helpful sir, I've already tried hard failed in other ways, but I understand it from you in one go. Please accept my sincere thanks!

junqiangyao
Автор

Many Thanks Mr.khayde for crystal clear session. well done !

mahdidlp
Автор

Awesome Explanation, Understood by watching once. 😄

bubusharma
Автор

Really great explanation sir, I'm learning more easily and progressing faster rather than reading our manual in Graph Theory, thank you.

PepsiBlueEnjoyer
Автор

Such an explanation is great if you want to do last minute studying (not revision) for your exams. You can also use it to just mug up algorithms for your exams.

akshaynerekar
Автор

your video has been very helpful, thank you.

otiliaphiri
Автор

Hi sir.. in the video at time 3:30 how weight of edge CD is changed from 6 to 1?

javaidakhtar
Автор

Sir Why did you change the value at c, d suddenly at 3;30 ??

mohammedmubashshiralam
Автор

This is a fantastic explanation no doubt. But I did expect a "competitive programer" to explain an algorithm with optimizations too.

akshaynerekar
Автор

Thank you so much, it was really helpful. But I just wonder how we can unsure that this algo always produces the minimum spanning tree.

ahmedouyahya
Автор

I can understand very easily sir thank. You sir

rachanasheelam
Автор

Which one is the best algorithm.... Kruskals algorithm or Prims

Kaviyugamithran
Автор

Thank you very much! It was very helpful for my preparation to quiz!

madina
Автор

Hi Vivekanand can you upload video for java program impl of prim algorithm.

asmashaikh
Автор

Video is very good but please used good mic for noise cancel.

SandipDas-bdpt
Автор

Sir knapsack problem in dynamic programming please

sunidhidwivedi