# DFS Visitor Concept

This concept defines the visitor interface for `depth_first_search()`. Users can define a class with the DFS Visitor interface and pass and object of the class to `depth_first_search()`, thereby augmenting the actions taken during the graph search.

### Refinement of

Copy Constructible (copying a visitor should be a lightweight operation).

### Notation

`V` | A type that is a model of DFS Visitor.
`vis` | An object of type `V`.
`G` | A type that is a model of Graph.
`g` | An object of type `G`.
`e` | An object of type `boost::graph_traits<G>::edge_descriptor`.
`s,u` | An object of type `boost::graph_traits<G>::vertex_descriptor`.

### Associated Types

none

### Valid Expressions

Name | Expression | Return Type | Description
--- | --- | --- | ---
Initialize Vertex | `vis.initialize_vertex(s, g)` | `void` | This is invoked on every vertex of the graph before the start of the graph search.
Start Vertex | `vis.start_vertex(s, g)` | `void` | This is invoked on the source vertex once before the start of the search.
Discover Vertex | `vis.discover_vertex(u, g)` | `void` | This is invoked when a vertex is encountered for the first time.
Examine Edge | `vis.examine_edge(e, g)` | `void` | This is invoked on every out-edge of each vertex after it is discovered.
Tree Edge | `vis.tree_edge(e, g)` | `void` | This is invoked on each edge as it becomes a member of the edges that form the search tree.
Back Edge | `vis.back_edge(e, g)` | `void` | This is invoked on the back edges in the graph.
Forward or Cross Edge | `vis.forward_or_cross_edge(e, g)` | `void` | This is invoked on forward or cross edges in the graph. In an undirected graph this method is never called.
Finish Vertex | `vis.finish_vertex(u, g)` | `void` | This invoked on a vertex after all of its out edges have been added to the search tree and all of the adjacent vertices have been discovered (but before their out-edges have been examined).

### Models

- `dfs_visitor`

Copyright © 2000 | Jeremy Siek, Univ.of Notre Dame (jsiek@lsc.nd.edu) Lie-Quan Lee, Univ.of Notre Dame (llee1@lsc.nd.edu) Andrew Lumsdaine, Univ.of Notre Dame (lums@lsc.nd.edu)