******** fig9.59 **********

	void
	dfs( vertex v )
	{
		visited[v] = TRUE;
		for each w adjacent to v
			if( !visited[w] )
				dfs( w );
	}