Struct ojo_graph::partition::Partition

pub struct Partition<G: Graph + ?Sized> { /* fields omitted */ }

A partition of a the nodes of a graph.

Tarjan's algorithm decomposes a directed graph into strongly connected components. Moreover, those components are ordered topologically.

Methods

impl<G: Graph + ?Sized> Partition<G>

pub fn num_components(&self) -> usize

pub fn parts<'b>(&'b self) -> impl Iterator<Item = &'b HashSet<G::Node>>

pub fn part(&self, i: usize) -> &HashSet<G::Node>

pub fn index_of(&self, u: &G::Node) -> usize

pub fn into_parts(self) -> Vec<HashSet<G::Node>>

Trait Implementations

impl<G: Graph + ?Sized> Graph for Partition<G>

type Node = usize

type Edge = usize

fn nodes<'a>(&'a self) -> Box<dyn Iterator<Item = usize>>

fn out_edges<'a>(&'a self, u: &usize) -> Box<dyn Iterator<Item = usize> + 'a>

fn in_edges<'a>(&'a self, u: &usize) -> Box<dyn Iterator<Item = usize> + 'a>

fn out_neighbors<'a>(
    &'a self,
    u: &Self::Node
) -> Map<Box<dyn Iterator<Item = Self::Edge> + 'a>, fn(_: Self::Edge) -> Self::Node>

fn in_neighbors<'a>(
    &'a self,
    u: &Self::Node
) -> Map<Box<dyn Iterator<Item = Self::Edge> + 'a>, fn(_: Self::Edge) -> Self::Node>

Important traits for Dfs<'a, G>

impl<'a, G: Graph + ?Sized> Iterator for Dfs<'a, G> type Item = Visit<G::Node>;

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

Important traits for Dfs<'a, G>

impl<'a, G: Graph + ?Sized> Iterator for Dfs<'a, G> type Item = Visit<G::Node>;

fn dfs_from<'a>(&'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>(&'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<'a, 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<'a, 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>(&'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>(&'a self) -> Option<Vec<Self::Node>>

fn neighbor_set<'a, I: Iterator<Item = &'a Self::Node>>(
    &self,
    set: I
) -> HashSet<Self::Node> where
    Self::Node: 'a, 

Returns the set of all nodes that are adjacent (either an in-neighbor or an out-neighbor) to something in set.