Struct Graph 

pub struct Graph {
    pub packages: HashMap<String, Package>,
    pub edges: HashMap<String, Vec<(String, Vec<EdgeKind>)>>,
    pub members: Vec<String>,
}

The resolved crate graph.

Fields

packages: HashMap<String, Package>

Package id → name/version.

edges: HashMap<String, Vec<(String, Vec<EdgeKind>)>>

Package id → outgoing edges (dependency package id, edge kinds).

members: Vec<String>

Workspace member package ids.

Implementations

impl Graph

pub fn ids_named(&self, name: &str) -> Vec<&str>

Package ids whose crate name is exactly name.

pub fn path_to( &self, starts: &[&str], target: &str, allowed: &HashSet<EdgeKind>, ) -> Option<Vec<String>>

BFS from starts to the first package named target, traversing only allowed edge kinds. Returns the evidence path as name vX labels.

pub fn duplicates(&self) -> Vec<(String, Vec<String>)>

Crate names that resolve at more than one version, with the versions.