Struct SkelGraph Copy item path

impl SkelGraph

pub fn add_vertex(&mut self) -> usize

Adds a new vertex to the graph and returns it.

pub fn add_vertices(&mut self, n: usize) -> Range<usize>

Adds n new vertices to the graphs and returns them.

pub fn add_edge(&mut self, src: usize, tgt: usize) -> usize

Adds a new edge to the graph and returns it.

pub fn make_edge(&mut self) -> usize

Adds a new edge without initializing its source or target.

Trait Implementations§

impl Clone for SkelGraph

fn clone(&self) -> SkelGraph

Returns a copy of the value. Read more

1.0.0 · Source§

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

Performs copy-assignment from source. Read more

impl ColumnarGraph for SkelGraph

type V = usize

Type of vertices in the graph.

type E = usize

Type of edges in the graph.

type Vertices = SkelFinSet

The set of vertices.

type Edges = SkelFinSet

The set of edges.

type Src = SkelIndexedColumn

The map assigning each edge its source vertex.

type Tgt = SkelIndexedColumn

The map assigning each edge its target vertex.

fn vertex_set(&self) -> &Self::Vertices

Gets the set of vertices.

fn edge_set(&self) -> &Self::Edges

Gets the set of edges.

fn src_map(&self) -> &Self::Src

Gets the mapping assigning a source vertex to each edge.

fn tgt_map(&self) -> &Self::Tgt

Gets the mapping assignment a target vertex to each edge.

fn get_src(&self, e: &Self::E) -> Option<&Self::V>

Gets the source of an edge, possibly undefined.

fn get_tgt(&self, e: &Self::E) -> Option<&Self::V>

Gets the target of an edge, possibly undefined.

impl Default for SkelGraph

fn default() -> SkelGraph

Returns the “default value” for a type. Read more

impl FiniteColumnarGraph for SkelGraph

fn iter_invalid(&self) -> impl Iterator<Item = InvalidGraphData<Self::E>>

Iterates over failures to be a valid graph.

impl MutColumnarGraph for SkelGraph

fn src_map_mut(&mut self) -> &mut Self::Src

Variant of src_map that returns a mutable reference.

fn tgt_map_mut(&mut self) -> &mut Self::Tgt

Variant of tgt_map that returns a mutable reference.

fn set_src(&mut self, e: Self::E, v: Self::V) -> Option<Self::V>

Sets the source of an edge.

fn set_tgt(&mut self, e: Self::E, v: Self::V) -> Option<Self::V>

Sets the target of an edge.

impl PartialEq for SkelGraph

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

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

1.0.0 · Source§

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 Validate for SkelGraph

type ValidationError = InvalidGraphData<usize>

The type of a validation error. Read more

fn validate(&self) -> Result<(), NonEmpty<Self::ValidationError>>

Validates the object.

impl Eq for SkelGraph

impl StructuralPartialEq for SkelGraph

Auto Trait Implementations§

impl UnwindSafe for SkelGraph

Blanket Implementations§

impl<T> Any for T
where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

impl<T> Borrow<T> for T
where T: ?Sized,

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

impl<T> BorrowMut<T> for T
where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

impl<T> CloneToUninit for T
where T: Clone,

unsafe fn clone_to_uninit(&self, dst: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)

Performs copy-assignment from self to dst. Read more

impl<G> FinGraph for G
where G: FiniteColumnarGraph,

fn vertices(&self) -> impl Iterator<Item = <G as Graph>::V>

Iterates over the vertices in the graph.

fn edges(&self) -> impl Iterator<Item = <G as Graph>::E>

Iterates over the edges in the graph.

fn in_edges(&self, v: &<G as Graph>::V) -> impl Iterator<Item = <G as Graph>::E>

Iterates over the edges incoming to a vertex. Read more

fn out_edges( &self, v: &<G as Graph>::V, ) -> impl Iterator<Item = <G as Graph>::E>

Iterates over the edges outgoing from a vertex. Read more

fn vertex_count(&self) -> usize

Number of vertices in the graph.

fn edge_count(&self) -> usize

Number of edges in the graph.

fn in_degree(&self, v: &Self::V) -> usize

Number of edges incoming to a vertex.

fn out_degree(&self, v: &Self::V) -> usize

Number of edges outgoing from a vertex.

fn degree(&self, v: &Self::V) -> usize

Number of edges incoming to or outgoing from a vertex. Read more

impl<T> From<T> for T

fn from(t: T) -> T

Returns the argument unchanged.

impl<G> Graph for G
where G: ColumnarGraph,

type V = <G as ColumnarGraph>::V

Type of vertices in graph.

type E = <G as ColumnarGraph>::E

Type of edges in graph.

fn has_vertex(&self, v: &<G as Graph>::V) -> bool

Does the graph contain the value as a vertex?

fn has_edge(&self, e: &<G as Graph>::E) -> bool

Does the graph contain the value as an edge?

fn src(&self, e: &<G as Graph>::E) -> <G as Graph>::V

Gets the source of an edge, assumed to be contained in the graph.

fn tgt(&self, e: &<G as Graph>::E) -> <G as Graph>::V

Gets the target of an edge, assumed to be contained in the graph.

impl<T, U> Into for T
where U: From<T>,

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

impl<T> IntoEither for T

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more

impl<T> Same for T

type Output = T

Should always be Self

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.

impl<T> ToOwned for T
where T: Clone,

type Owned = T

The resulting type after obtaining ownership.

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more

impl<T, U> TryFrom for T
where U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

impl<T, U> TryInto for T
where U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.