Struct Relation 

pub struct Relation { /* private fields */ }

Implementations

impl Relation

pub fn new() -> Self

An empty relation.

pub fn insert(&mut self, src: Vertex, tgt: Vertex) -> bool

Insert the edge (src, tgt). Returns true if it was not already present.

pub fn contains(&self, src: &Vertex, tgt: &Vertex) -> bool

True when (src, tgt) is in the relation.

pub fn len(&self) -> usize

Number of edges.

pub fn is_empty(&self) -> bool

True when there are no edges.

pub fn iter(&self) -> impl Iterator<Item = (&Vertex, &Vertex)>

Iterate edges in canonical (lexicographic) order.

pub fn union(&self, other: &Relation) -> Relation

Edge set union.

pub fn intersection(&self, other: &Relation) -> Relation

Edge set intersection.

pub fn difference(&self, other: &Relation) -> Relation

Edge set difference.

pub fn targets(&self) -> VertexSet

The set of vertices that appear as a target on some edge.

pub fn image(&self, sources: &VertexSet) -> VertexSet

Forward image: { y | exists x in sources, (x, y) in self }.

pub fn preimage(&self, targets: &VertexSet) -> VertexSet

Backward image: { x | exists y in targets, (x, y) in self }.

pub fn reversed(&self) -> Relation

Reverse every edge: maps (s, t) to (t, s).

pub fn transitive_closure(&self) -> Relation

Irreflexive transitive closure (E+).

Tarjan’s Strongly Connected Component algorithm, then DAG reachability propagation: O(V + E + sum(component-size^2)).

Trait Implementations

impl Clone for Relation

fn clone(&self) -> Relation

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Relation

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

Formats the value using the given formatter.

impl Default for Relation

fn default() -> Relation

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for Relation

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for Relation

impl FromIterator<(Vertex, Vertex)> for Relation

fn from_iter<I: IntoIterator<Item = (Vertex, Vertex)>>(iter: I) -> Self

Creates a value from an iterator.

impl<'a> IntoIterator for &'a Relation

type Item = (&'a Vertex, &'a Vertex)

The type of the elements being iterated over.

type IntoIter = Map<Iter<'a, (Vertex, Vertex)>, fn(&'a (Vertex, Vertex)) -> (&'a Vertex, &'a Vertex)>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl PartialEq for Relation

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for Relation

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for Relation