{"id":25469968,"url":"https://github.com/thinkphp/topsort","last_synced_at":"2025-11-04T18:30:25.484Z","repository":{"id":20385658,"uuid":"23661359","full_name":"thinkphp/topsort","owner":"thinkphp","description":"Topological Sort. DFS traversal. infoarena","archived":false,"fork":false,"pushed_at":"2024-06-03T07:11:27.000Z","size":56,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2024-06-03T08:57:50.210Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/thinkphp.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2014-09-04T12:25:20.000Z","updated_at":"2024-06-03T08:58:00.642Z","dependencies_parsed_at":"2024-06-03T08:57:59.360Z","dependency_job_id":"043a112e-24b2-48de-87d1-420451c97b1f","html_url":"https://github.com/thinkphp/topsort","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thinkphp%2Ftopsort","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thinkphp%2Ftopsort/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thinkphp%2Ftopsort/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thinkphp%2Ftopsort/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/thinkphp","download_url":"https://codeload.github.com/thinkphp/topsort/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":239437000,"owners_count":19638411,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2025-02-18T08:31:33.814Z","updated_at":"2025-11-04T18:30:25.112Z","avatar_url":"https://github.com/thinkphp.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Topological Sort\n \n  In computer science, a topological sort of a directed graph is a linear ordering of its vertices such that for every directed edge\n  uv from vertex v, u come before v in the ordering. For instance, the vertices of the graph may represent tasks to be performed\n  and the edges may represent constraints that one task must be performed before another.\n\n### Practice:\n\n*  https://ideone.com/XnoRDz\n*  https://ideone.com/o3aDYK\n*  https://ideone.com/6zVliF (Python)\n* https://ideone.com/thinkphp/topsort\n\n#### Problem Set\n\n* https://infoarena.ro/problema/sortaret\n* https://leetcode.com/tag/topological-sort/\n* https://leetcode.com/problems/course-schedule/description/\n\n####  References\n\n  * http://en.wikipedia.org/wiki/Topological_sorting\n \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fthinkphp%2Ftopsort","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fthinkphp%2Ftopsort","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fthinkphp%2Ftopsort/lists"}