1.Previous
3.Next

Pseudocode

* Input: A graph G and a vertex v of G.
* Output: A labeling of the edges in the connected component of v as discovery edges and back edges.

procedure DFS(G, v) is label v as explored for all edges e in G.incidentEdges(v) do if edge e is unexplored then w <- G.adjacentVertex(v, e) if vertex w is unexplored then label e as a discovered edge recursively call DFS(G, w) else label e as a back edge

1.Previous
3.Next