Struct GraphStack

pub struct GraphStack<T> { /* private fields */ }

Implementations

impl<T> GraphStack<T>

pub fn new() -> Self

pub fn push(&mut self, value: T, ancestors: &[usize]) -> usize

Adds an element to the graph-stack and returns an item-id for it. This id can later be used to add ancestors for this item.

pub fn add_ancestors(&mut self, id: usize, ancestors: &[usize])

pub fn stacks(&self, start_item: usize) -> Stacks<'_, T>

Build an iterator over the stacks encoded by this GraphStack. A start_item is required because there may be multiple top items.