Spring 2009, 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. 14, 35, 22, 1, 3, 17, 23, CSI-06)

Find out the components of a graph

Problem 2 (roll Nos. 12, 8, 19, 9, 38, 15, 6, CSI-17)

Spanning tree in a unweighted graph

Problem 3 (roll Nos. 31, 39, 21, 33, 34, 5, 2, CSI-15, CSI-03)

Prim's algorithm for shortest spanning tree

Problem 4 (roll Nos. 10, 29, 44, 37, 41, 27, 16, CSI-07)

Shortest path between a pair of vertices

Problem 5 (roll Nos. 40, 46, 13, 45, 7, 4, 28, 20, CSI-01)

Breadth-first search of a Graph

Problem 6 (roll Nos. 24, 36, 30, 26, 25, 42, 18, 43, CSI-04)

Depth-first search of a Graph

Submission Date : 06-04-09


Back to my Home page