Topological sort of the graph.
Namespace:
QuickGraph.AlgorithmsAssembly: QuickGraph.Algorithms (in QuickGraph.Algorithms.dll) Version: 2.4.2.1514 (2.4.2.1514)
Syntax
| C# |
|---|
public class TopologicalSortAlgorithm |
| Visual Basic (Declaration) |
|---|
Public Class TopologicalSortAlgorithm |
Remarks
The topological sort algorithm creates a linear ordering of the vertices such that if edge (u,v) appears in the graph, then v comes before u in the ordering.
The graph must be a directed acyclic graph (DAG). The implementation consists mainly of a call to DepthFirstSearchAlgorithm.
This algorithm is directly inspired from the BoostGraphLibrary implementation.
