TopologicalSorterTVertex, TEdge Constructor (GraphBaseTVertex, TEdge, Boolean) |
Namespace:
SD.Tools.Algorithmia.Graphs.Algorithms
Assembly:
SD.Tools.Algorithmia (in SD.Tools.Algorithmia.dll) Version: 1.3.3.0 (1.3.18.0209)
Syntax public TopologicalSorter(
GraphBase<TVertex, TEdge> graphToCrawl,
bool directionMeansOrder
)
Public Sub New (
graphToCrawl As GraphBase(Of TVertex, TEdge),
directionMeansOrder As Boolean
)
Parameters
- graphToCrawl
- Type: SD.Tools.Algorithmia.GraphsGraphBaseTVertex, TEdge
The directed graph to crawl. - directionMeansOrder
- Type: SystemBoolean
If set to true, a directed edge from A to B is interpreted as the order in which A and B should be done, i.e. first A
then B. When false is passed (default) the edge from A to B is interpreted as A is depending on B and therefore B should be done before A.
See Also