[−][src]Trait cjdns_snode::pathsearch::graph::GraphBuilder
Graph building functions.
Required methods
fn add_node<I: IntoIterator<Item = (T, W)>>(&mut self, node_tag: T, links: I)
Implementors
impl<T, W> GraphBuilder<T, W> for Dijkstra<T, W> where
T: Eq + Hash,
W: PartialEq + PartialOrd + Zero,
[src]
T: Eq + Hash,
W: PartialEq + PartialOrd + Zero,