diff options
Diffstat (limited to 'src/swarm/tree.rs')
| -rw-r--r-- | src/swarm/tree.rs | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/src/swarm/tree.rs b/src/swarm/tree.rs index 9c9651e..b9491b3 100644 --- a/src/swarm/tree.rs +++ b/src/swarm/tree.rs @@ -2,9 +2,9 @@ //! link that works, and as soon as the member before it has them. //! //! The tree is the same on every node, computed from what they share: the graph the -//! member list gives (`topology::member_list_graph`: every member's neighbours, as if -//! all reached all) and what each member tells its neighbours it reaches -//! (`swarm::reach`). Every member's distance from the writer over that graph orders the +//! member list gives, with the links members recorded as not working taken out and those +//! it lacks that do added (`topology::working_graph`, `swarm::working_links`), and what +//! each member tells its neighbours it reaches (`swarm::reach`). Every member's distance from the writer over that graph orders the //! members: by distance, then whether it reaches a member a hop closer, then pair key; //! a member's parent is the neighbour it reaches that comes before it, the closest to //! the writer first (a link much slower than its fastest to one counting a hop more), @@ -53,7 +53,7 @@ pub(crate) struct Trees { /// The graph, and every member's distance from `writer` (by pair key) over it; None /// while the member list isn't known, or `writer` isn't in it. fn distances(state: &AppState, writer: u64) -> Option<(Arc<Graph>, Arc<HashMap<String, u32>>)> { - let graph = topology::member_list_graph(state)?; + let graph = topology::working_graph(state)?; let mut trees = state.trees.lock_or_recover(); if !trees .graph |