[−][src]Struct libojo::LiveGraph
A wrapper around Graggle
implementing the [graph::Graph
] trait.
This represents only the part of the graggle containing live nodes. To examine the entire graggle
(i.e. including deleted nodes), use FullGraph
.
Trait Implementations
impl<'a> Graph for LiveGraph<'a>
[src]
type Node = NodeId
type Edge = Edge
fn nodes<'b>(&'b self) -> Box<dyn Iterator<Item = Self::Node> + 'b>
[src]
fn out_edges<'b>(
&'b self,
u: &NodeId
) -> Box<dyn Iterator<Item = Self::Edge> + 'b>
[src]
&'b self,
u: &NodeId
) -> Box<dyn Iterator<Item = Self::Edge> + 'b>
fn in_edges<'b>(
&'b self,
u: &NodeId
) -> Box<dyn Iterator<Item = Self::Edge> + 'b>
[src]
&'b self,
u: &NodeId
) -> Box<dyn Iterator<Item = Self::Edge> + 'b>
fn out_neighbors(
&'a self,
u: &Self::Node
) -> Map<Box<dyn Iterator<Item = Self::Edge> + 'a>, fn(Self::Edge) -> Self::Node>
[src]
&'a self,
u: &Self::Node
) -> Map<Box<dyn Iterator<Item = Self::Edge> + 'a>, fn(Self::Edge) -> Self::Node>
fn in_neighbors(
&'a self,
u: &Self::Node
) -> Map<Box<dyn Iterator<Item = Self::Edge> + 'a>, fn(Self::Edge) -> Self::Node>
[src]
&'a self,
u: &Self::Node
) -> Map<Box<dyn Iterator<Item = Self::Edge> + 'a>, fn(Self::Edge) -> Self::Node>
fn dfs(&'a self) -> Dfs<'a, Self>
[src]
fn dfs_from(&'a self, root: &Self::Node) -> Dfs<'a, Self>
[src]
fn has_path(&self, u: &Self::Node, v: &Self::Node) -> bool
[src]
fn tarjan(&self) -> Partition<Self>
[src]
fn weak_components(&self) -> Partition<Self>
[src]
fn doubled(&'a self) -> Doubled<'a, Self>
[src]
Returns the graph that has edges in both directions for every edge that this graph has in one direction. Read more
fn node_filtered<F>(&'a self, predicate: F) -> NodeFiltered<'a, Self, F> where
F: Fn(&Self::Node) -> bool,
[src]
F: Fn(&Self::Node) -> bool,
Returns the subgraph of this graph that is induced by the set of nodes for which predicate
returns true
. Read more
fn edge_filtered<F>(&'a self, predicate: F) -> EdgeFiltered<'a, Self, F> where
F: Fn(&Self::Node, &Self::Edge) -> bool,
[src]
F: Fn(&Self::Node, &Self::Edge) -> bool,
Returns the subgraph of this graph containing all the edges for which the predicate returns true. Read more
fn top_sort(&'a self) -> Option<Vec<Self::Node>>
[src]
If this graph is acyclic, returns a topological sort of the vertices. Otherwise, returns None
. Read more
fn linear_order(&'a self) -> Option<Vec<Self::Node>>
[src]
fn neighbor_set<'a, I>(&self, set: I) -> HashSet<Self::Node, RandomState> where
I: Iterator<Item = &'a Self::Node>,
Self::Node: 'a,
[src]
I: Iterator<Item = &'a Self::Node>,
Self::Node: 'a,
Returns the set of all nodes that are adjacent (either an in-neighbor or an out-neighbor) to something in set
. Read more
Auto Trait Implementations
Blanket Implementations
impl<T> From for T
[src]
impl<T, U> Into for T where
U: From<T>,
[src]
U: From<T>,
impl<T, U> TryFrom for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = !
try_from
)The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T> Borrow for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> BorrowMut for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T, U> TryInto for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
try_from
)The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<T> Same for T
type Output = T
Should always be Self