Struct libjp::FullGraph

pub struct FullGraph<'a>(_);

A wrapper around Graggle implementing the [graph::Graph] trait.

This represents only the entire graggle, even the nodes that are deleted. To examine only the live parts of the graggle, use LiveGraph.

Trait Implementations

impl<'a> Graph for FullGraph<'a>

type Node = NodeId

type Edge = Edge

fn nodes<'b>(&'b self) -> Box<dyn Iterator<Item = Self::Node> + 'b>

fn out_edges<'b>(
    &'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>

fn out_neighbors(
    &'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>

fn dfs(&'a self) -> Dfs<'a, Self>

fn dfs_from(&'a self, root: &Self::Node) -> Dfs<'a, Self>

fn has_path(&self, u: &Self::Node, v: &Self::Node) -> bool

fn tarjan(&self) -> Partition<Self>

fn weak_components(&self) -> Partition<Self>

fn doubled(&'a self) -> Doubled<'a, Self>

Returns the graph that has edges in both directions for every edge that this graph has in one direction.

fn node_filtered<F>(&'a self, predicate: F) -> NodeFiltered<'a, Self, F> where
    F: Fn(&Self::Node) -> bool, 

Returns the subgraph of this graph that is induced by the set of nodes for which predicate returns true.

fn edge_filtered<F>(&'a self, predicate: F) -> EdgeFiltered<'a, Self, F> where
    F: Fn(&Self::Node, &Self::Edge) -> bool, 

Returns the subgraph of this graph containing all the edges for which the predicate returns true.

fn top_sort(&'a self) -> Option<Vec<Self::Node>>

If this graph is acyclic, returns a topological sort of the vertices. Otherwise, returns None.

fn linear_order(&'a self) -> Option<Vec<Self::Node>>

fn neighbor_set<'a, I>(&self, set: I) -> HashSet<Self::Node, RandomState> where
    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.