Struct DependencyGraph

pub struct DependencyGraph { /* private fields */ }

An acyclic, directed dependency graph.

Implementations

impl DependencyGraph

pub fn root_info(&self) -> &PackageInfo

pub fn id(&self) -> &PackageId

pub fn root(&self) -> NodeIndex

pub fn graph(&self) -> &DiGraph<Node, Edge>

pub fn packages(&self) -> &BTreeMap<PackageId, NodeIndex>

Get a mapping from PackageIds to NodeIndexs.

pub fn iter_dependencies( &self, ) -> impl Iterator<Item = (&PackageId, BTreeMap<&str, &PackageId>)> + '_

Get an iterator over all the packages in this dependency graph and their dependency mappings.

pub fn visualise(&self) -> String

Visualise this graph as a DOT program.

Trait Implementations

impl Clone for DependencyGraph

fn clone(&self) -> DependencyGraph

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for DependencyGraph

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

Formats the value using the given formatter.

impl Index<&NodeIndex> for DependencyGraph

type Output = Node

The returned type after indexing.

fn index(&self, index: &NodeIndex) -> &Self::Output

Performs the indexing (container[index]) operation.

impl Index<&PackageId> for DependencyGraph

type Output = Node

The returned type after indexing.

fn index(&self, index: &PackageId) -> &Self::Output

Performs the indexing (container[index]) operation.

impl Index<NodeIndex> for DependencyGraph

type Output = Node

The returned type after indexing.

fn index(&self, index: NodeIndex) -> &Self::Output

Performs the indexing (container[index]) operation.

impl PartialEq for DependencyGraph

fn eq(&self, other: &Self) -> 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 Eq for DependencyGraph