@ -31,6 +31,7 @@ algorithm based on a globally-agreed spanning tree and greedy routing in a
@@ -31,6 +31,7 @@ algorithm based on a globally-agreed spanning tree and greedy routing in a
metric space, and aims to implement some novel local backpressure routing
techniques. In theory, Yggdrasil should scale well on networks with
internet-like topologies.</description>
<releaseNotes>Release notes can be found in [changelog](https://github.com/yggdrasil-network/yggdrasil-go/blob/master/CHANGELOG.md).</releaseNotes>