Struct EdgeMapped 

pub struct EdgeMapped {
    pub graph: Graph,
    pub edge_map1: Vec<EdgeId>,
    pub edge_map2: Vec<EdgeId>,
}

A graph produced by a binary operator, together with the edge maps that relate its edges to the edges of the two operands.

The meaning (and the length) of the maps depends on the operator: see Graph::union_map, Graph::intersection_map and Graph::compose_map.

Fields

graph: Graph

The resulting graph.

edge_map1: Vec<EdgeId>

Edge map relating the result to the first operand (self).

edge_map2: Vec<EdgeId>

Edge map relating the result to the second operand.

Trait Implementations

impl Clone for EdgeMapped

fn clone(&self) -> EdgeMapped

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for EdgeMapped

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

Formats the value using the given formatter.

impl PartialEq for EdgeMapped

fn eq(&self, other: &EdgeMapped) -> 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 StructuralPartialEq for EdgeMapped