Trait GraphSimple 

pub trait GraphSimple<T> {
    // Required methods
    fn edge_obj(&self, e: u32) -> &T;
    fn to_left(&self, e: u32) -> u32;
    fn to_right(&self, e: u32) -> u32;
    fn n_from(&self, v: usize) -> usize;
    fn n_to(&self, v: usize) -> usize;
    fn v_from(&self, v: usize, n: usize) -> usize;
    fn v_to(&self, v: usize, n: usize) -> usize;
    fn e_from(&self, v: usize, n: usize) -> usize;
    fn e_to(&self, v: usize, n: usize) -> usize;
    fn o_from(&self, v: usize, n: usize) -> &T;
    fn o_to(&self, v: usize, n: usize) -> &T;
    fn get_predecessors(&self, v: &[i32], x: &mut Vec<u32>);
    fn get_predecessors1(&self, v: i32, x: &mut Vec<u32>);
    fn get_successors(&self, v: &[i32], x: &mut Vec<u32>);
    fn get_successors1(&self, v: i32, x: &mut Vec<u32>);
    fn have_path(&self, v: i32, w: i32) -> bool;
    fn components(&self, comp: &mut Vec<Vec<u32>>);
    fn components_e(&self, comp: &mut Vec<Vec<u32>>);
    fn components_e_pos_sorted(&self, comp: &mut Vec<Vec<u32>>);
}

Required Methods

fn edge_obj(&self, e: u32) -> &T

fn to_left(&self, e: u32) -> u32

fn to_right(&self, e: u32) -> u32

fn n_from(&self, v: usize) -> usize

fn n_to(&self, v: usize) -> usize

fn v_from(&self, v: usize, n: usize) -> usize

fn v_to(&self, v: usize, n: usize) -> usize

fn e_from(&self, v: usize, n: usize) -> usize

fn e_to(&self, v: usize, n: usize) -> usize

fn o_from(&self, v: usize, n: usize) -> &T

fn o_to(&self, v: usize, n: usize) -> &T

fn get_predecessors(&self, v: &[i32], x: &mut Vec<u32>)

fn get_predecessors1(&self, v: i32, x: &mut Vec<u32>)

fn get_successors(&self, v: &[i32], x: &mut Vec<u32>)

fn get_successors1(&self, v: i32, x: &mut Vec<u32>)

fn have_path(&self, v: i32, w: i32) -> bool

fn components(&self, comp: &mut Vec<Vec<u32>>)

fn components_e(&self, comp: &mut Vec<Vec<u32>>)

fn components_e_pos_sorted(&self, comp: &mut Vec<Vec<u32>>)

Implementations on Foreign Types

impl<S, T, U, V> GraphSimple<T> for Graph<S, T, U, V>

where U: EdgeType, V: IndexType,

fn edge_obj(&self, e: u32) -> &T

fn to_left(&self, e: u32) -> u32

fn to_right(&self, e: u32) -> u32

fn n_from(&self, v: usize) -> usize

fn n_to(&self, v: usize) -> usize

fn v_from(&self, v: usize, n: usize) -> usize

fn v_to(&self, v: usize, n: usize) -> usize

fn e_from(&self, v: usize, n: usize) -> usize

fn e_to(&self, v: usize, n: usize) -> usize

fn o_from(&self, v: usize, n: usize) -> &T

fn o_to(&self, v: usize, n: usize) -> &T

fn get_predecessors(&self, v: &[i32], x: &mut Vec<u32>)

fn get_predecessors1(&self, v: i32, x: &mut Vec<u32>)

fn get_successors(&self, v: &[i32], x: &mut Vec<u32>)

fn get_successors1(&self, v: i32, x: &mut Vec<u32>)

fn have_path(&self, v: i32, w: i32) -> bool

fn components(&self, comp: &mut Vec<Vec<u32>>)

fn components_e(&self, comp: &mut Vec<Vec<u32>>)

fn components_e_pos_sorted(&self, comp: &mut Vec<Vec<u32>>)

Implementors