Trait graph::UndirectedGraph[−][src]

pub trait UndirectedGraph<Node: Idx>: Graph<Node> {
    fn degree(&self, node: Node) -> Node;

    fn neighbors(&self, node: Node) -> &[Node];
}
Expand description

A graph where the order within an edge tuple is unimportant.

The edge (42, 1337) is equivalent to the edge (1337, 42).

Required methods

Returns the number of edges connected to the given node.

Returns a slice of all nodes connected to the given node.

Implementors