pub struct VecGraph<ID = u32> { /* private fields */ }
Expand description
A vector based graph data structure.
Implementations§
Trait Implementations§
source§impl<'de, ID> Deserialize<'de> for VecGraph<ID>where
ID: Deserialize<'de>,
impl<'de, ID> Deserialize<'de> for VecGraph<ID>where ID: Deserialize<'de>,
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl<ID> Directed for VecGraph<ID>where
ID: PrimInt + Unsigned + 'static,
impl<ID> Directed for VecGraph<ID>where ID: PrimInt + Unsigned + 'static,
§type IncidentIt<'a> = NeighIt<'a, ID>
type IncidentIt<'a> = NeighIt<'a, ID>
Type of an iterator over all incident edges.
§type DirectedEdge<'a> = <VecGraph<ID> as GraphType>::Edge<'a>
type DirectedEdge<'a> = <VecGraph<ID> as GraphType>::Edge<'a>
Type of a directed edge.
source§fn out_iter(&self, u: Self::Node<'_>) -> Self::OutIt<'_>
fn out_iter(&self, u: Self::Node<'_>) -> Self::OutIt<'_>
Return a graph iterator over the edges leaving a node.
source§fn in_iter(&self, u: Self::Node<'_>) -> Self::InIt<'_>
fn in_iter(&self, u: Self::Node<'_>) -> Self::InIt<'_>
Return a graph iterator over the edges leaving a node.
source§fn incident_iter(&self, u: Self::Node<'_>) -> Self::IncidentIt<'_>
fn incident_iter(&self, u: Self::Node<'_>) -> Self::IncidentIt<'_>
Return an iterator over all directed edges incident with a node.
source§fn outedges(
&self,
u: Self::Node<'_>
) -> GraphIter<'_, Self, <Self as Directed>::OutIt<'_>> ⓘwhere
Self: Sized,
fn outedges( &self, u: Self::Node<'_> ) -> GraphIter<'_, Self, <Self as Directed>::OutIt<'_>> ⓘwhere Self: Sized,
Return an iterator over the edges leaving a node.
source§fn outgoing(&self) -> OutEdges<'_, Self>where
Self: Sized,
fn outgoing(&self) -> OutEdges<'_, Self>where Self: Sized,
Return access to the outgoing arcs via an
Adjacencies
trait. Read moresource§fn inedges(
&self,
u: Self::Node<'_>
) -> GraphIter<'_, Self, <Self as Directed>::InIt<'_>> ⓘwhere
Self: Sized,
fn inedges( &self, u: Self::Node<'_> ) -> GraphIter<'_, Self, <Self as Directed>::InIt<'_>> ⓘwhere Self: Sized,
Return an iterator over the edges leaving a node.
source§fn incoming(&self) -> InEdges<'_, Self>where
Self: Sized,
fn incoming(&self) -> InEdges<'_, Self>where Self: Sized,
Return access to the incoming arcs via an
Adjacencies
trait. Read moresource§fn incident_edges(
&self,
u: Self::Node<'_>
) -> GraphIter<'_, Self, <Self as Directed>::IncidentIt<'_>> ⓘwhere
Self: Sized,
fn incident_edges( &self, u: Self::Node<'_> ) -> GraphIter<'_, Self, <Self as Directed>::IncidentIt<'_>> ⓘwhere Self: Sized,
Return an iterator over all directed edges incident with a node.
source§impl<ID> FiniteGraph for VecGraph<ID>where
ID: PrimInt + Unsigned,
impl<ID> FiniteGraph for VecGraph<ID>where ID: PrimInt + Unsigned,
source§fn nodes_iter(&self) -> Self::NodeIt<'_>
fn nodes_iter(&self) -> Self::NodeIt<'_>
Return a graph iterator over all nodes.
source§fn edges_iter(&self) -> Self::EdgeIt<'_>
fn edges_iter(&self) -> Self::EdgeIt<'_>
Return a graph iterator over all edges. Read more
source§fn enodes(&self, e: Self::Edge<'_>) -> (Self::Node<'_>, Self::Node<'_>)
fn enodes(&self, e: Self::Edge<'_>) -> (Self::Node<'_>, Self::Node<'_>)
Return the nodes connected by an edge. Read more
source§fn nodes(&self) -> NodeIterator<'_, Self>where
Self: Sized,
fn nodes(&self) -> NodeIterator<'_, Self>where Self: Sized,
Return an iterator over all nodes.
source§impl<ID> IndexGraph for VecGraph<ID>where
ID: PrimInt + Unsigned + 'static,
impl<ID> IndexGraph for VecGraph<ID>where ID: PrimInt + Unsigned + 'static,
source§impl<ID> Undirected for VecGraph<ID>where
ID: PrimInt + Unsigned + 'static,
impl<ID> Undirected for VecGraph<ID>where ID: PrimInt + Unsigned + 'static,
source§fn neigh_iter(&self, u: Self::Node<'_>) -> Self::NeighIt<'_>
fn neigh_iter(&self, u: Self::Node<'_>) -> Self::NeighIt<'_>
Return a graph iterator over the edges adjacent to some node.
Auto Trait Implementations§
impl<ID> RefUnwindSafe for VecGraph<ID>where ID: RefUnwindSafe,
impl<ID> Send for VecGraph<ID>where ID: Send,
impl<ID> Sync for VecGraph<ID>where ID: Sync,
impl<ID> Unpin for VecGraph<ID>where ID: Unpin,
impl<ID> UnwindSafe for VecGraph<ID>where ID: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more