Spring 2008, CS 421 GRAPH THEORY
Write programs for the problems given below. The students bearing roll numbers
given against each problem have to submit that particular problem for
evaluation.
Problem 1 (roll Nos. 11, 19, 33, 29, 35, 27, 21, 6, 4)
Find out the components of a graph
Problem 2 (roll Nos. 12, 24, 7, 31, 30, 2, 12, 20, 28)
Spanning tree in a unweighted graph
Problem 3 (roll Nos. 17, 13, 22, 34, 26, 32, 23, 16, 10)
Prim's algorithm for shortest spanning tree
Problem 4 (roll Nos. 5, 15, 1, 25, 3, 14, 8, 9)
Shortest path between a pair of vertices
Submission Date : 30-04-08
Back to my Home page