https://github.com/arunkumar201/topological_sorting
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 depth_first_search().
https://github.com/arunkumar201/topological_sorting
Last synced: about 1 year ago
JSON representation
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 depth_first_search().
- Host: GitHub
- URL: https://github.com/arunkumar201/topological_sorting
- Owner: arunkumar201
- Created: 2021-02-07T10:37:25.000Z (over 5 years ago)
- Default Branch: main
- Last Pushed: 2021-02-07T10:40:51.000Z (over 5 years ago)
- Last Synced: 2025-02-10T15:18:39.099Z (over 1 year ago)
- Language: C
- Size: 1000 Bytes
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0