Function topologicalSort

topologicalSort(graph): Result<Readonly<{
at: Edge;
}>, Vertex[]>
Sorts the vertices of a directed acyclic graph (DAG) in the topological order. It is useful for resolving dependencies.
Parameters
- graph: Graph
  A graph to sort.
Returns Result<Readonly<{
at: Edge;
}>, Vertex[]>
The topological order vertices of Ok, or a CycleError on Err only if there is a cycle.
- Defined in src/graph.ts:287

Generated using TypeDoc