{"id":15710849,"url":"https://github.com/evscott/distributed-rst","last_synced_at":"2025-03-30T16:28:35.163Z","repository":{"id":83556203,"uuid":"210176830","full_name":"evscott/Distributed-RST","owner":"evscott","description":"An implementation of Michel Raynal's definition of a distributed rooted spanning tree creation algorithm.","archived":false,"fork":false,"pushed_at":"2019-10-12T00:00:41.000Z","size":195,"stargazers_count":3,"open_issues_count":0,"forks_count":0,"subscribers_count":4,"default_branch":"master","last_synced_at":"2025-02-05T18:25:30.116Z","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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2019-09-22T16:14:45.000Z","updated_at":"2024-08-24T12:22:02.000Z","dependencies_parsed_at":"2023-07-07T18:45:57.589Z","dependency_job_id":null,"html_url":"https://github.com/evscott/Distributed-RST","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-RST","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/evscott%2FDistributed-RST/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/evscott%2FDistributed-RST/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/evscott%2FDistributed-RST/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/evscott","download_url":"https://codeload.github.com/evscott/Distributed-RST/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246346316,"owners_count":20762560,"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:26.681Z","updated_at":"2025-03-30T16:28:35.140Z","avatar_url":"https://github.com/evscott.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Distributed Rooted Spanning Tree\n\nAn implementation of a distributed rooted spanning tree following the definition put forward by Michel Raynal in _Distributed Algorithm's for Message Passing Systems._\n\n### Example graph:\n\n- Dotted edges represent channels not belonging to the spanning tree.\n- Filled edges represent channels with arrows oriented towards the root of the spanning tree.\n\ne.g.: Node `i`'s neighbors are `{a, j, f, k}`, and it's children are `{j, k}`\n\n![examplegraph](assets/examplegraph.png)\n\n### Raynal's pseudocode:\n![pseudocode](assets/pseudocode.png)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fevscott%2Fdistributed-rst","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fevscott%2Fdistributed-rst","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fevscott%2Fdistributed-rst/lists"}