Struct Graph

pub struct Graph<N: Clone, E: Clone> { /* private fields */ }

Implementations

impl Graph<PackageId, HashSet<Dependency>>

pub fn parents_of( &self, p: PackageId, ) -> impl Iterator<Item = (PackageId, bool)> + '_

impl<N: Eq + Ord + Clone, E: Default + Clone> Graph<N, E>

pub fn new() -> Graph<N, E>

pub fn add(&mut self, node: N)

pub fn link(&mut self, node: N, child: N) -> &mut E

pub fn contains<Q>(&self, k: &Q) -> bool

where N: Borrow<Q>, Q: Ord + Eq + ?Sized,

pub fn edge(&self, from: &N, to: &N) -> Option<&E>

pub fn edges(&self, from: &N) -> impl Iterator<Item = &(N, E)>

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

A topological sort of the Graph

pub fn iter(&self) -> impl Iterator<Item = &N>

pub fn is_path_from_to<'a>(&'a self, from: &'a N, to: &'a N) -> bool

Checks if there is a path from from to to.

pub fn path_to_bottom<'a>(&'a self, pkg: &'a N) -> Vec<&'a N>

Resolves one of the paths from the given dependent package down to a leaf.

pub fn path_to_top<'a>(&'a self, pkg: &'a N) -> Vec<&'a N>

Resolves one of the paths from the given dependent package up to the root.

Trait Implementations

impl<N: Eq + Ord + Clone, E: Clone> Clone for Graph<N, E>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<N: Display + Eq + Ord + Clone, E: Clone> Debug for Graph<N, E>

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

Formats the value using the given formatter.

impl<N: Eq + Ord + Clone, E: Default + Clone> Default for Graph<N, E>

fn default() -> Graph<N, E>

Returns the “default value” for a type.

impl<N: Eq + Ord + Clone, E: Eq + Clone> PartialEq for Graph<N, E>

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<N: Eq + Ord + Clone, E: Eq + Clone> Eq for Graph<N, E>