ABSTRACT
In this chapter we describe a systematic method for exploring a graph. This method known as depth-first search, in short, DFS, has proved very useful in the design of several efficient algorithms [2,3]. We describe three of these application, namely, biconnectivity, strong connectivity and s− t numbering algorithms.
