competitive::graph

Type Alias BidirectionalSparseGraph

Source 
pub type BidirectionalSparseGraph = SparseGraph<BidirectionalEdge>;

Aliased Type§

pub struct BidirectionalSparseGraph {
    pub start: Vec<usize>,
    pub elist: Vec<Adjacency>,
    pub edges: Vec<(usize, usize)>,
    /* private fields */
}

Fields§

§start: Vec<usize>§elist: Vec<Adjacency>§edges: Vec<(usize, usize)>

Implementations§

Source§

impl BidirectionalSparseGraph

Source

pub fn to_graphvis<N, NA, E, EA>(&self, node_attr: N, edge_attr: E) -> String
where N: Fn(usize) -> NA, E: Fn(usize) -> EA, NA: Display, EA: Display,