Next:
8.1 Some Definitions
Up:
DSA
Previous:
7.8.2 Strong Components
8. Undirected Graphs
8.1 Some Definitions
8.2 Depth First and Breadth First Search
8.2.1 Breadth-first search of undirected graph
8.3 Minimum-Cost Spanning Trees
8.3.1 MST Property
8.3.2 Prim's Algorithm
8.3.3 Kruskal's Algorithm
8.4 Traveling Salesman Problem
8.4.1 A Greedy Algorithm for TSP
8.4.2 Optimal Solution for TSP using Branch and Bound
8.5 To Probe Further
8.6 Problems
8.7 Programming Assignments
8.7.1 Implementation of Some Graph Algorithms
8.7.2 Traveling Salesman Problem
eEL,CSA_Dept,IISc,Bangalore
