{"id":34851415,"url":"https://github.com/shiningflash/graph-algorithm","last_synced_at":"2026-05-20T12:42:31.602Z","repository":{"id":111949358,"uuid":"152547173","full_name":"shiningflash/Graph-Algorithm","owner":"shiningflash","description":"Here are Graph Theory Algorithms in CPP","archived":false,"fork":false,"pushed_at":"2021-01-27T04:58:18.000Z","size":113,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-04-09T20:02:03.278Z","etag":null,"topics":["bellman-ford-algorithm","bfs","dfs","dijkstra-shortest-path","flood-fill-algorithm","floyd-warshall-algorithm","graph","graph-theory","graph-theory-algorithms","kruskal-algorithm","prims-alorithm","strongly-connected-components"],"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/shiningflash.png","metadata":{},"created_at":"2018-10-11T07:09:36.000Z","updated_at":"2021-10-15T22:44:28.000Z","dependencies_parsed_at":null,"dependency_job_id":"be8ad18c-821d-4436-bba6-34504ef25b33","html_url":"https://github.com/shiningflash/Graph-Algorithm","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/shiningflash/Graph-Algorithm","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shiningflash%2FGraph-Algorithm","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shiningflash%2FGraph-Algorithm/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shiningflash%2FGraph-Algorithm/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shiningflash%2FGraph-Algorithm/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/shiningflash","download_url":"https://codeload.github.com/shiningflash/Graph-Algorithm/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shiningflash%2FGraph-Algorithm/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28035466,"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","status":"online","status_checked_at":"2025-12-25T02:00:05.988Z","response_time":58,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["bellman-ford-algorithm","bfs","dfs","dijkstra-shortest-path","flood-fill-algorithm","floyd-warshall-algorithm","graph","graph-theory","graph-theory-algorithms","kruskal-algorithm","prims-alorithm","strongly-connected-components"],"created_at":"2025-12-25T19:19:46.889Z","updated_at":"2025-12-25T19:20:11.929Z","avatar_url":"https://github.com/shiningflash.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":null,"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshiningflash%2Fgraph-algorithm","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fshiningflash%2Fgraph-algorithm","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshiningflash%2Fgraph-algorithm/lists"}