This C++ code implements a topological sorting algorithm for a directed acyclic graph (DAG) using Depth-First Search (DFS) and backtracking techniques. Topological sorting is used to order the vertices of a graph in such a way that for every directed edge u -> v, vertex u comes before vertex v in the ordering.
active 2024-03-14 → 2024-03-14 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 1 days from 2024-03-14 to 2024-03-14. Pushes: 1 total, peak 1 in a day. Pull requests: 0 total, peak 0 in a day. Issues: 0 total, peak 0 in a day. Comments: 0 total, peak 0 in a day. Stars: 0 total, peak 0 in a day.
- Pushes
- Pull requests
- Issues
- Comments
- Stars
Top contributors
Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity
| Contributor | Contributions | Pushes | PRs | Comments |
|---|---|---|---|---|
| RAHAFSALMAN7 | 1 | 1 | 0 | 0 |
Recent activity
Latest issues, pull requests and releases
No issue or PR events — this repo's activity is pushes only.
Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 0 stars here means stars gained during the window, not the repo's star count.