Function

topologicalSort

Performs a topological sort on a directed acyclic graph (DAG).

Include Headers

seqan/graph_algorithms.h

Parameters

In-parameter:A directed acyclic graph. Types: Directed Graph | |

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