24- Kruskal Algorithm | Graph Theory | Python

Kruskal algorithm to find the minimum cost spanning tree uses the greedy approach. This algorithm treats the graph as a forest and every node it has as an individual tree. A tree connects to another only and only if, it has the least cost among all available options and does not violate MST properties.
Telegram Link - https://t.me/codewithr
Youtube Link - codewithr
Playlist Link - Graph Theory Full Series | Python | I...

#CodeWithR
#Coding

Graph Theory Videos Links:
01-Adjacency List VS Adjacency Matrix - 01- Graph representation in Data Stru...
02-DFS - 02- DFS Graph Traversals | Depth Firs...
03-Counting Connected Component - 03- Connected Components | How to fin...
04-Single Source Shortest Path - 04- Single Source Shortest Path | Gra...
05-Bipartite Graph - 05- Bipartite Graph | Graph Theory | ...
06-Cycle Detection - 06- Cycle Detection | Graph Theory | ...
07-In/Out Time - 07- In/Out Time In a Tree | Graph The...
08-Diameter of a Tree - 08- Diameter Of A Tree  | Graph Theor...
09-Calculating SubTree Size - 09-  Calculating SubTreeSize | Graph ...
10-Finding Bridges - 10-  Finding Bridges | Graph Theory |...
11-Articulation Points - 11- Articulation Point | Graph Theory...
12-BFS - 12- Breadth First Search (BFS) | Grap...
13-SSSP Using BFS - 13- Single Source Shortest Path using...
14-Topological Sort - 14-Topological Sort (Kahn's Algortihm...
15-Introduction To 2D Grid - 15- Introduction to 2D Grid | Graph T...
16-DFS on 2D Grid - 16- Depth First Search(DFS) on 2D Gri...
17-BFS on 2D Grid - 17- Breadth First Search (BFS) on 2D ...
18-Questions On 2D Grid - 18- Questions on 2D Grid | Graph Theo...
19-Jungle Run - 19- Jungle Run | Graph Theory | Python
20-Counting Rooms - 20- Counting Rooms | Graph Theory | P...
21-Chess Knight Moves - 21- Chess Knight Moves | Graph Theory...
22-Minimum Spanning Tree - 22- Minimum Spanning Tree | Graph The...
23-Disjoint Set - 23- Disjoint Set | Graph Theory | Python
24-Kruskal Algorithm - 24- Kruskal Algorithm | Graph Theory ...
25-Concept Of Heap - 25-  Concept Of Heap | Graph Theory |...
26-Prims Algorithm - Video
27-Dijkstra's Algorithm - 27- Dijkstra Algorithm | Graph Theory...
28-Bellman Ford - 28- Bellmanford Algorithm | Graph The...
29-Floydwarshall Algorithm - Video
30-Tarjan's Algorithm - 30- Tarjan's Algorithm | Graph Theory...

• #education
• #kruska_algorithm
• #inout_time
• #singe_source_shortest_path
• #dfs
• #adjacency_list_vs_adjacency_matrix
• #counting_connected_component
• #bipartite_graph
• #cycle_detection
• #diameter_of_a_tree
• #bfs
• #sssp_using_bfs
• #topological_sort
• #introduction_to_2d_grid
• #dfs_on_2d_grid
• #bfs_on_2d_grid
• #jungle_run
• #counting_rooms
• #chess_knight_moves
• #minimum_spanning_tree
• #disjoint_set
• #concept_of_heap
• #prims_algorithm
• #dijkstras_algorithm
• #bellman_ford
• #floydwarshall_algorithm