depthFirstSearch

| Function depthFirstSearch Implements a depth-first search on a graph. depthFirstSearch(g, predecessor, discovery, finish) Include Headers seqan/graph_algorithms.h Parameters
g | In-parameter:A graph. Types: Directed Graph, Undirected Graph
predecessor | Out-parameter:A property map. Remarks: Predecessor subgraph produced by the depth-first search.
discovery | Out-parameter:A property map. Remarks: The discovery time of a vertex v.
finish | Out-parameter:A property map. Remarks: The time when v's adjacency list has been fully explored.
Remarks In contrast to a breadth-first search the depth-first search is repeated from multiple sources if the graph is not connected. Hence, depth-first search produces a depth-first forest. To ensure each vertex ends up in exactly one tree we need not just a distance but a discovery and finishing time. Return Values void. Example Programs Depth-First Search See Also breadthFirstSearch SeqAn - Sequence Analysis Library - www.seqan.de

Page built @2011/02/08 21:37:03