[−][src]Struct saboten::cactusgraph::BridgeForest
A bridge forest derived from a cactus graph. Holds a reference to the original biedged graph used to build the cactus graph, and tracks the vertex projections from the original graph.
Fields
original_graph: &'a BiedgedGraph
graph: BiedgedGraph
projection: Projection
Implementations
impl<'a> BridgeForest<'a>
[src]
pub fn from_cactus_graph(cactus_graph: &CactusGraph<'a>) -> Self
[src]
pub fn find_bridge_pairs(&self) -> FnvHashSet<BridgePair>
[src]
Find the bridge pairs in the graph, returning them as a set of snarls.
Trait Implementations
impl<'a> BiedgedWrapper for BridgeForest<'a>
[src]
fn base_graph(&self) -> &UnGraphMap<u64, BiedgedWeight>
[src]
fn biedged_graph(&self) -> &BiedgedGraph
[src]
fn projection(&self) -> &Projection
[src]
fn projected_node(&self, n: u64) -> u64
[src]
fn projected_edge(&self, (x, y): (u64, u64)) -> (u64, u64)
[src]
Auto Trait Implementations
impl<'a> RefUnwindSafe for BridgeForest<'a>
impl<'a> Send for BridgeForest<'a>
impl<'a> Sync for BridgeForest<'a>
impl<'a> Unpin for BridgeForest<'a>
impl<'a> UnwindSafe for BridgeForest<'a>
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
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<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,