https://github.com/thinkphp/topsort
Topological Sort. DFS traversal. infoarena
https://github.com/thinkphp/topsort
Last synced: 5 months ago
JSON representation
Topological Sort. DFS traversal. infoarena
- Host: GitHub
- URL: https://github.com/thinkphp/topsort
- Owner: thinkphp
- Created: 2014-09-04T12:25:20.000Z (over 11 years ago)
- Default Branch: master
- Last Pushed: 2024-06-03T07:11:27.000Z (almost 2 years ago)
- Last Synced: 2024-06-03T08:57:50.210Z (almost 2 years ago)
- Language: C++
- Homepage:
- Size: 54.7 KB
- Stars: 1
- Watchers: 3
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Topological Sort
In computer science, a topological sort of a directed graph is a linear ordering of its vertices such that for every directed edge
uv from vertex v, u come before v in the ordering. For instance, the vertices of the graph may represent tasks to be performed
and the edges may represent constraints that one task must be performed before another.
### Practice:
* https://ideone.com/XnoRDz
* https://ideone.com/o3aDYK
* https://ideone.com/6zVliF (Python)
* https://ideone.com/thinkphp/topsort
#### Problem Set
* https://infoarena.ro/problema/sortaret
* https://leetcode.com/tag/topological-sort/
* https://leetcode.com/problems/course-schedule/description/
#### References
* http://en.wikipedia.org/wiki/Topological_sorting