Enum ElementId

pub enum ElementId<Graph>
where
    Graph: Graph,
{
    Vertex(Graph::VertexId),
    Edge(Graph::EdgeId),
}

An identifier for a vertex or an edge in a graph.

Variants

Vertex(Graph::VertexId)

A vertex identifier.

Edge(Graph::EdgeId)

An edge identifier.

Trait Implementations

impl<Graph> Clone for ElementId<Graph>

where Graph: Graph,

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<Graph> Debug for ElementId<Graph>

where Graph: Graph + Debug, Graph::VertexId: Debug, Graph::EdgeId: Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<Graph> Hash for ElementId<Graph>

where Graph: Graph,

fn hash<__HGraph>(&self, __state: &mut __HGraph)

where __HGraph: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<Graph> PartialEq for ElementId<Graph>

where Graph: Graph,

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<Graph> Copy for ElementId<Graph>

where Graph: Graph,

impl<Graph> Eq for ElementId<Graph>

where Graph: Graph,