Template Class DfsSchema

• Defined in File Visit.h

Class Documentation

template<Graph G>
class DfsSchema

dfs-schema(): the discovery and finish times and the kind of each edge

Public Functions

explicit DfsSchema(const G &g)

template<class Edge>
void visit(int u, Edge &&edge)

the visit from u; edge( u , v , k ) on each edge examined, of kind k

Pre:

u is a node not discovered yet

Post:

u is finished after it is discovered

template<class Edge>
void visitAll(Edge &&edge)

the visits from all the nodes not discovered yet, in increasing order

int dt(int u) const

Pre:

u is a node

int ft(int u) const

Pre:

u is a node