Graph Data Structure | Part 10 | Kruskal's Algorithm

No video

Graph Data Structure | Part 10 | Kruskal's Algorithm | MST Step by Step Demo & Code

Рет қаралды 803

Күн бұрын

Chapters:
00:00 - Intro
00:50 - A quick review
02:05 - Prim’s Algorithm
08:54 - Dry-run of Code
12:13 - Final Thoughts
📚 Links to topics I talk about in the video:
Minimum Spanning Tree: • Graph Data Structure |...
Greedy Algorithms: • Greedy Algorithms with...
Graphs Introduction: • Graph Data Structure |...
Complete playlist: • Graphs
📘 A text based explanation is available at: studyalgorithms.com
Code on Github: github.com/nikoo28/java-solut...
📖 Reference Books:
Starting Learn to Code: amzn.to/3sJm8Wl
Favorite book to understand algorithms: amzn.to/4848xJH
Favorite book for data structures: amzn.to/3P96YBv
Get started for interview preparation: amzn.to/44Nn5du
🔗 To see more videos like this, you can show your support on: www.buymeacoffee.com/studyalg...
🎥 My Recording Gear:
Recording Light: amzn.to/3PdsViT
Microphone: amzn.to/3Exv83x
Recording Camera: amzn.to/3PwyN8e
Tablet to sketch and draw: amzn.to/3ZdKVy7
Sketching Tool: amzn.to/45XJEgY
Laptop to edit videos: amzn.to/460ofDu
💻 Get Social 💻
Follow on Facebook at: / studyalgos
Subscribe to RSS feeds: studyalgorithms.com/feed/
Join fan mail: eepurl.com/g9Dadv
#graphs #datastructures #interview

Пікірлер: 7

@kriss452 Ай бұрын

Literally the best Leetcode/DataStructure tutor in youtube especially for java programmers! You are amazing!

@abdulmalikmahasneh9853 2 ай бұрын

huge thanx for this astonishing explanation

@nikoo28 2 ай бұрын

Most welcome!

@nandhakumarkr3147 4 ай бұрын

Hi Nikhil, i went through your tutorial video of prim's and krushkal algorithm , both are absolutely conceptual and productive. I would like to re-iterate my understanding to you : Prim's algorithm and Krushkal algorithm for determining minimum spanning tree is based on same greedy criteria focused on minimum weight on edges with the difference the prim's algorithm is based on vertices dfs traversal pushing the vertices edges in to priority queue and krushkal algorithm is very greedy compare to prim's because it is directly pushing the edges into the priority queue to determine MST , correct me if i am wrong.

@aniketpurohit7601 6 ай бұрын

Amazing

@AqsaImran-lh4ic 6 ай бұрын

Is it possible that a graph has multiple graph types, means a graph in which vertice A have directed type with vertice B but have multi graph connection with vertice C and have also weight type/infinite type of graph with D... Or other vertices?? Means a whole graph is Implemented by different types of graph for different vertices??

@nikoo28 5 ай бұрын

yes, a graph can have mixed elements. you can have directed and undirected edges in a same graph. Same for weighted and unweighted graphs. It just depends on your use case and the application you are trying to implement.