The type of the graph object to traverse. Must model the incidence graph concept.
The descriptor type for vertices in a GraphT.
The visitor type.
The type of the property map that will be used to control the graph traversal. Must model a property map that stores Colours keyed by a VertexDescriptorT.
Performs a depth-first traversal of the graph, which can be customised using a visitor object. Note that disconnected graphs will still be entirely traversed - this function will walk the spanning tree of each disconnected component (in random order).