{"id":25684707,"url":"https://github.com/kudzaiprichard/graph-shortest-path-gui","last_synced_at":"2025-06-19T08:38:49.928Z","repository":{"id":200219082,"uuid":"662732903","full_name":"kudzaiprichard/graph-shortest-path-gui","owner":"kudzaiprichard","description":"Python tkinter graph algorithm with shortest path ","archived":false,"fork":false,"pushed_at":"2023-10-14T23:26:59.000Z","size":52,"stargazers_count":5,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-24T17:41:19.900Z","etag":null,"topics":["bellman-ford-algorithm","oop","pyhon3","python","shortest-path-algorithm","tkinter"],"latest_commit_sha":null,"homepage":"","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/kudzaiprichard.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}},"created_at":"2023-07-05T19:08:30.000Z","updated_at":"2024-11-14T21:09:37.000Z","dependencies_parsed_at":null,"dependency_job_id":"56046fb4-c1e9-47c5-aff5-5722e3943cb3","html_url":"https://github.com/kudzaiprichard/graph-shortest-path-gui","commit_stats":null,"previous_names":["kudzaiprichard/graph-shortest-path-gui"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/kudzaiprichard/graph-shortest-path-gui","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kudzaiprichard%2Fgraph-shortest-path-gui","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kudzaiprichard%2Fgraph-shortest-path-gui/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kudzaiprichard%2Fgraph-shortest-path-gui/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kudzaiprichard%2Fgraph-shortest-path-gui/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/kudzaiprichard","download_url":"https://codeload.github.com/kudzaiprichard/graph-shortest-path-gui/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kudzaiprichard%2Fgraph-shortest-path-gui/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":260718367,"owners_count":23051860,"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":["bellman-ford-algorithm","oop","pyhon3","python","shortest-path-algorithm","tkinter"],"created_at":"2025-02-24T17:32:31.425Z","updated_at":"2025-06-19T08:38:44.907Z","avatar_url":"https://github.com/kudzaiprichard.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Bellman-Ford Algorithm\n\nBellman-Ford Algorithm computes the single-source shortest path from a source node to all other nodes in a graph that \ncan contain negative edge weights. However, if a graph contains a negative weight cycle, the solution to the shortest \npath will not be produced. This algorithm is also used to detect the presence of negative weight cycle in a graph.\n\n\u003cdiv align=\"center\"\u003e\n   \u003cimg src=\"images/bellman.webp\" alt=\"bellman\" \u003e\n\u003c/div\u003e\n\n## How Bellman-Ford Algorithm works?\nThis algorithm overestimates the distance from the source node to all other nodes in a graph initially. \nThen repeatedly visited all the edges and relax the estimate when a new shorter path is discovered in each iteration. \nIf an iteration is not resulted in an update, we can stop the algorithm because the shortest path has been found. \nOtherwise, iterate all the edges at most n-1 times(n is the total number of nodes/vertices) since n-1 is the maximum \nlength of the shortest path could take. If a graph has no negative cycle, we are guarantee to find the optimized result\nafter n-1 iterations.\n\n## Why Iterate (n-1) times in Bellman-Ford Algorithm?\nIn Bellman-Ford Algorithm, we can iterate all the edges in any order and relax them. For the same graph, \nwhen we consider all the edges in different orders, we may get the optimized results after less than n-1 iterations \nor , in the worst case, need at most n-1 iterations to produces the shortest path .\n\n## Complexity\n* Time: O(v*e), Space: O(v)\n    \u003e v: the total number of vertices, e: the total number of edges\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkudzaiprichard%2Fgraph-shortest-path-gui","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkudzaiprichard%2Fgraph-shortest-path-gui","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkudzaiprichard%2Fgraph-shortest-path-gui/lists"}