PA_02_2008_Fall - CS300 Algorithm Programming Assignment #2...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CS300 Algorithm Programming Assignment #2 Graph-related algorithms GOAL Implement various graph-related algorithms Programming Requirements Language: only C (C++ is not allowed.) Environment: Windows (recommended) – Visual Studio 2005, 2008 Linux – gcc 4.x (TA will mark your PA on Ubuntu in this case.) Requirements (a) Menu-driven interface. Each algorithm has to be selected by menu. 1. Initialize Graph 2. Min-cost Spanning Tree 3. Dijkstra’s Shortest Path 4. Depth-First Search 5. Breadth-First Search 6. Biconnected Components 7. Strongly Connected Components 0. Exit (b) Input file name is ‘graph.dat’. File format is as follows. // input for undirected graph n (# of vertex) e1 (# of edges) s 1 d 1 (start/destination point for Dijkstra’s algorithm/DFS/BFS) v 11 v 12 w 1 (information of edges) v 21 v 22 w 2 …. v n1 v n2 w n // input for digraph m (# of vertex) e2 (# of edges) s 2 d 2 (start/destination point for Dijkstra’s algorithm/DFS/BFS) v 11 v 12 w 1 (information of edges)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/04/2010 for the course COMPUTER S cs300 taught by Professor Unkown during the Spring '08 term at Korea Advanced Institute of Science and Technology.

Page1 / 3

PA_02_2008_Fall - CS300 Algorithm Programming Assignment #2...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online