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

An implementation of Michel Raynal's definition of a distributed rooted spanning tree creation algorithm.
https://github.com/evscott/distributed-rst

Last synced: 14 days ago
JSON representation

An implementation of Michel Raynal's definition of a distributed rooted spanning tree creation algorithm.

• Host: GitHub
• URL: https://github.com/evscott/distributed-rst
• Owner: evscott
• Created: 2019-09-22T16:14:45.000Z (over 5 years ago)
• Default Branch: master
• Last Pushed: 2019-10-12T00:00:41.000Z (about 5 years ago)
• Last Synced: 2024-10-24T21:29:12.050Z (2 months ago)
• Language: Go
• Homepage:
• Size: 190 KB
• Stars: 3
• Watchers: 4
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Distributed Rooted Spanning Tree

An implementation of a distributed rooted spanning tree following the definition put forward by Michel Raynal in _Distributed Algorithm's for Message Passing Systems._

### Example graph:

- Dotted edges represent channels not belonging to the spanning tree.

- Filled edges represent channels with arrows oriented towards the root of the spanning tree.

e.g.: Node `i`'s neighbors are `{a, j, f, k}`, and it's children are `{j, k}`

![examplegraph](assets/examplegraph.png)

### Raynal's pseudocode:

![pseudocode](assets/pseudocode.png)