Struct cargo::util::graph::Graph [] [src]

pub struct Graph<N> {
    // some fields omitted
}

Methods

impl<N: Eq + Hash + Clone> Graph<N>

fn new() -> Graph<N>

fn add(&mut self, node: N, children: &[N])

fn get_nodes(&self) -> &HashMap<N, HashSet<N>>

fn edges(&self, node: &N) -> Option<Edges<N>>

fn sort(&self) -> Option<Vec<N>>

fn iter(&self) -> Nodes<N>

Trait Implementations

impl<N: Display + Eq + Hash> Debug for Graph<N>

fn fmt(&self, fmt: &mut Formatter) -> Result

impl<N: Eq + Hash> PartialEq for Graph<N>

fn eq(&self, other: &Graph<N>) -> bool

fn ne(&self, other: &Rhs) -> bool

impl<N: Eq + Hash> Eq for Graph<N>

impl<N: Eq + Hash + Clone> Clone for Graph<N>

fn clone(&self) -> Graph<N>

fn clone_from(&mut self, source: &Self)