pub type UnGraphMap<N, E> = GraphMap<N, E, Undirected>;Expand description
A GraphMap with undirected edges.
For example, an edge between 1 and 2 is equivalent to an edge between 2 and 1.
Aliased Type§
pub struct UnGraphMap<N, E> {
nodes: OrderMap<N, Vec<(N, CompactDirection)>>,
edges: OrderMap<(N, N), E>,
ty: PhantomData<Undirected>,
}Fields§
§nodes: OrderMap<N, Vec<(N, CompactDirection)>>§edges: OrderMap<(N, N), E>§ty: PhantomData<Undirected>