Given a start node s, a general algorithm for the DFS approach is as follows:
Procedure DFS(s)
Examples:
Last modified: 27/July/98 (12:14)