Function
topologicalSort
Performs a topological sort on a directed acyclic graph (DAG).
topologicalSort(g, topSort)
Include Headers
seqan/graph_algorithms.h
Parameters
g
In-parameter:A directed acyclic graph.
topSort
Out-parameter:A linear ordering of the vertices.
Types: String
Remarks
A topological sort is a linear ordering of all its vertices such that if the graph contains an edge (u,v) then u appears before v in the ordering.
Return Values
void.
Example Programs
SeqAn - Sequence Analysis Library - www.seqan.de
 

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