AlgoGenesis is a centralized open-source platform dedicated to providing optimized and well-documented algorithm implementations in C. Perfect for both beginners and advanced users, this repository serves as a comprehensive learning resource for solving algorithmic challenges.
MIT License
70
stars
219
forks
source link
[NEW ALGORITHM] Want to add Topological sort in graph folder #395
Topological sort is a linear ordering of vertices in a directed acyclic graph (DAG) such that for every directed edge (u, v), vertex u appears before vertex v. It is commonly used in scheduling tasks and resolving dependencies.
Checklist:
[ ] Contributor in GSSoC-ext
[ ] Want to work on it
Additional Information:
Provide any other relevant information or resources regarding the algorithm.
Description:
Topological sort is a linear ordering of vertices in a directed acyclic graph (DAG) such that for every directed edge (u, v), vertex u appears before vertex v. It is commonly used in scheduling tasks and resolving dependencies.
Checklist:
Additional Information:
Provide any other relevant information or resources regarding the algorithm.