Trait circomspect_program_structure::static_single_assignment::traits::DirectedGraphNode

source · [−]
pub trait DirectedGraphNode {
    fn index(&self) -> Index;
    fn predecessors(&self) -> &IndexSet;
    fn successors(&self) -> &IndexSet;
}
Expand description

This trait is used to make graph algorithms (like dominator tree and dominator frontier generation) generic over the graph node type for unit testing purposes.

Required Methods

Implementors