{"id":15710800,"url":"https://github.com/evscott/distributed-bfa","last_synced_at":"2025-03-30T16:28:38.635Z","repository":{"id":64297714,"uuid":"214549468","full_name":"evscott/Distributed-BFA","owner":"evscott","description":"An implementation of Michel Raynal's definition of a distributed Bellman-Ford algorithm.","archived":false,"fork":false,"pushed_at":"2019-10-13T18:21:05.000Z","size":171,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-05T18:25:29.205Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"Go","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/evscott.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":"2019-10-12T00:24:30.000Z","updated_at":"2023-10-31T19:21:02.000Z","dependencies_parsed_at":"2023-01-15T09:00:49.472Z","dependency_job_id":null,"html_url":"https://github.com/evscott/Distributed-BFA","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/evscott%2FDistributed-BFA","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/evscott%2FDistributed-BFA/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/evscott%2FDistributed-BFA/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/evscott%2FDistributed-BFA/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/evscott","download_url":"https://codeload.github.com/evscott/Distributed-BFA/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246346482,"owners_count":20762596,"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-10-03T21:10:15.162Z","updated_at":"2025-03-30T16:28:38.607Z","avatar_url":"https://github.com/evscott.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Distributed Bellman-Ford Algorithm\n\nAn implementation of Bellman-Ford's shortest path finding algorithm on a distributed system, following the definition put forward by Michel Raynal in _Distributed Algorithm's for Message Passing Systems._\n\n### Example graph:\n\n- The communication channels are bidirectional; i.e., `{1, 2}` and `{2, 1}` represent the same channel.\n- The communication channels are positive in length/weight.\n\n![example](./assets/example.png)\n\n### Raynal's psuedocode:\n\n![async](./assets/psuedocode-async.png)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fevscott%2Fdistributed-bfa","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fevscott%2Fdistributed-bfa","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fevscott%2Fdistributed-bfa/lists"}