https://github.com/evscott/distributed-bfa

An implementation of Michel Raynal's definition of a distributed Bellman-Ford algorithm.
https://github.com/evscott/distributed-bfa

Last synced: about 1 year ago
JSON representation

An implementation of Michel Raynal's definition of a distributed Bellman-Ford algorithm.

• Host: GitHub
• URL: https://github.com/evscott/distributed-bfa
• Owner: evscott
• Created: 2019-10-12T00:24:30.000Z (over 6 years ago)
• Default Branch: master
• Last Pushed: 2019-10-13T18:21:05.000Z (over 6 years ago)
• Last Synced: 2025-02-05T18:25:29.205Z (over 1 year ago)
• Language: Go
• Homepage:
• Size: 167 KB
• Stars: 2
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# Distributed Bellman-Ford Algorithm

An 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._

### Example graph:

- The communication channels are bidirectional; i.e., `{1, 2}` and `{2, 1}` represent the same channel.

- The communication channels are positive in length/weight.

![example](./assets/example.png)

### Raynal's psuedocode:

![async](./assets/psuedocode-async.png)