basic traversal algorithm in graph
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
DFS
DFS.c the first commit Nov 3, 2011
README the first commit Nov 3, 2011
input.txt the first commit Nov 3, 2011
output.txt the first commit Nov 3, 2011

README

This program simulate the process of DFS

To run this program, you have to save the initiation data of the graph into the file "input.txt". And redirect this file to the program. The format of "input.txt" is as follows:
n p
node other_node
node other_node
......
where n is the number of nodes in the graph
	  p is the number of edges in the graph
	  and the following p lines give the edges
Note: We assume the graph to be directed