8:14
Degree of an undirected graph| regular graph|isolated pendent graphs|Data structures|JNTUH R18| OU
Lavanya's computer classes
Degree of Undirected Graph in telugu|Data Structures|JNTUH R18| OU BSc computers syllabus
10:00
Postorder tree traversal methods|data structures| JNTUH R18 CSE
12:14
BFS traversal method in telugu|Graph traversal methods in Telugu
6:23
spanning tree| how to construct spanning tree from original graph|Design and Analysis of Algorithms
11:22
minimum spanning tree | Kruskal's algorithm | example | DAA | Data structures|Greedy method
4:54
Minimum spanning tree Prim's algorithm |prim's algorithm| Greedy method
