{"id":20502356,"url":"https://github.com/sonph/pygraph","last_synced_at":"2025-04-13T20:09:38.506Z","repository":{"id":14174717,"uuid":"16880843","full_name":"sonph/pygraph","owner":"sonph","description":"Simple graph algorithms written in Python.","archived":false,"fork":false,"pushed_at":"2014-02-16T08:05:16.000Z","size":104,"stargazers_count":8,"open_issues_count":0,"forks_count":3,"subscribers_count":3,"default_branch":"master","last_synced_at":"2023-08-01T22:36:51.586Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Python","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/sonph.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}},"created_at":"2014-02-16T07:58:32.000Z","updated_at":"2023-08-01T22:36:51.587Z","dependencies_parsed_at":"2022-07-08T06:41:10.465Z","dependency_job_id":null,"html_url":"https://github.com/sonph/pygraph","commit_stats":null,"previous_names":[],"tags_count":0,"template":null,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sonph%2Fpygraph","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sonph%2Fpygraph/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sonph%2Fpygraph/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sonph%2Fpygraph/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sonph","download_url":"https://codeload.github.com/sonph/pygraph/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":224832889,"owners_count":17377442,"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":"2024-11-15T19:21:36.230Z","updated_at":"2024-11-15T19:21:37.635Z","avatar_url":"https://github.com/sonph.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Pygraph\n\nSimple graph algorithms in Python I implemented for the algorithms and data structures course.\n\nThe algorithms include:\n- DFS\n- BFS\n- Topological sort\n- Dijkstra's single source shortest path\n- Bellman Ford single source shortest path w/ negative weight edges\n- Kruskal's minimum spanning tree\n- Tarjan's strongly connected components and articulation points\n- Hierholzer's algorithm for finding an Eulerian path\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsonph%2Fpygraph","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsonph%2Fpygraph","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsonph%2Fpygraph/lists"}