[−][src]Trait generic_graph::Graph
This trait does not add methods. It just indicates that the graph is not directed.
As such, the vectors returned by the method neighbors(&self, from: &K) and leading_to(&self, to: &K) contains the same keys, eventually in different order (Unless the graph muted between calls).
Also the outcome the methods accepting a pair of keys (adjacent(...), get_edge(...), get_mutable_edge(...)) must not be influenced by the order of the keys.