Kruskal's Algorithm in C | CourseGalaxy

Autoplay
Autocomplete

Previous Lesson Complete and Continue

Advanced Data Structures and Algorithms In C

About Course

Advanced Data Structures and Algorithms In C (1:16)
Source Code Repository

AVL Tree

Introduction (7:13)
Rotations (7:09)
Insertion in AVL Tree - 1 (10:42)
Insertion in AVL Tree - 2 (9:42)
Insertion in AVL Tree - 3 (14:13)
Insertion in AVL Tree - 4 (4:40)
Examples of insertion in AVL Tree (7:45)
Deletion in AVL Tree - 1 (5:21)
Deletion in AVL Tree - 2 (10:36)
Deletion in AVL Tree - 3 (6:11)
Examples of deletion in AVL Tree (7:58)

Threaded Binary Tree

Introduction (12:46)
Insertion (5:05)
Deletion (7:50)

Expression Tree

Introduction (3:00)
Constructing and Evaluating an Expression Tree (5:42)
Implementation of Expression Tree (4:04)

B Tree

Introduction (11:03)
Inorder Traversal (4:33)
Searching (8:04)
Insertion (14:20)
Implementation of Insertion - 1 (15:55)
Implementation of Insertion - 2 (6:14)
Deletion (3:47)
Examples of Deletion from Leaf Node (9:31)
Examples of Deletion from Non-Leaf Node (3:31)
Implementation of Deletion (10:17)

Graph

Introduction (3:25)
Terminology (9:09)
Cycles (3:13)
Connectivity in Undirected Graph (5:50)
Connectivity in Directed Graphs (3:23)
Tree and Forest (3:16)
Representation of Graph : Adjacency Matrix (5:40)
Adjacency Matrix in C (14:39)
Representation of Graph : Adjacency List (5:51)
Adjacency List in C (9:18)
Transitive closure of a directed graph and Path Matrix (9:28)
Warshall’s Algorithm (10:18)
Warshall’s Algorithm in C (1:55)

Traversal in Graph

Introduction (2:42)
Breadth First Search (5:05)
Implementation of Breadth First Search (8:22)
Finding Shortest path in an unweighted graph (8:26)
BFS Spanning Tree (2:38)
BFS in Undirected Graphs : Finding Connected Components (7:03)
Depth First Search (3:41)
Implementation of Depth First Search through Stack (8:40)
Recursive Implementation of Depth First Search (5:45)
Classification of Edges in DFS of Directed Graph (6:41)
Classification of Edges in DFS of Undirected Graph (5:17)

Shortest Path in Graph

Shortest Path Problem (2:25)
Dijkstra’s Algorithm (9:04)
Dijkstra’s Algorithm : Example (8:29)
Dijkstra’s Algorithm in C (4:47)

Minimum Spanning Tree of a Graph

Introduction (1:31)
Prim's Algorithm (3:38)
Prim's Algorithm : Example (6:10)
Prim's Algorithm in C (3:37)
Kruskal's Algorithm (2:33)
Kruskal's Algorithm : Example (3:48)
Implementation of Kruskal's Algorithm (10:29)
Kruskal's Algorithm in C (5:19)

Teach online with

Kruskal's Algorithm in C

Complete and Continue

Discussion

0 comments