Trait graphene::core::constraint::Unique [−] [src]

pub trait Unique: ConstrainedGraph where
    <Self::VertexIter as IntoIterator>::IntoIter: ExactSizeIterator,
    <Self::EdgeIter as IntoIterator>::IntoIter: ExactSizeIterator, { }

A marker trait for graphs containing only unique edges.

An edge is unique if it is the only edge in the graph connecting two vertices. If the graph is directed then between two vertices v1 and v2 two edges are allowed: (v1,v2,) and (v2,v1,). If the graph is undirected, there may only be one edge of either (v1,v2,) or (v1,v2,). Regardless of directedness, only one loop is allowed for each vertex, i.e. only one (v,v,_).

Implementors