Sortable Minimum shape required for topological sorting.
id
type
stringdepends_on
type
Array<string>sort.ts
Generic topological sort using Kahn's algorithm.
Orders items so that dependencies come before dependents.
Works with any item type that has id and optional depends_on.
Declarations #
3 declarations
Sortable #
Sortable
topological_sort #
topological_sort
<T extends Sortable>(items: T[], label?: string): TopologicalSortResult<T> Sort items by their dependencies using Kahn's algorithm.
Returns items ordered so that dependencies come before dependents. If a cycle is detected, returns an error with the cycle path.
items
array of items to sort
type
T[]label
label for error messages (e.g. "resource", "step")
type
string default
'item'returns
TopologicalSortResult<T> sorted items or error if cycle detected
TopologicalSortResult #
TopologicalSortResult
TopologicalSortResult<T> Result of topological sort.
generics
T
constraint Sortable