Rafkev / sorting

Topological sorting is used for ordering tasks or nodes in a directed acyclic graph (DAG) such that for every directed edge uv from vertex u to vertex v, u comes before v in the ordering. Here's a JavaScript implementation of topological sorting using depth-first search (DFS)
1Updated 9 months ago

Related projects

Alternatives and complementary repositories for sorting