Struct WorkspaceGraph 

pub struct WorkspaceGraph { /* private fields */ }

Workspace dependency graph.

Built from cargo_metadata, using petgraph for efficient traversals.

Implementations

impl WorkspaceGraph

pub fn from_metadata(metadata: &Metadata) -> RailResult<Self>

Load workspace graph from cargo metadata.

Performance

• Graph construction: 10-50ms
• Path cache: built eagerly (10-50ms)
• Does not reload metadata (use existing from CargoState)

pub fn workspace_members(&self) -> &[String]

Get all workspace member crate names (pre-sorted).

pub fn transitive_dependents(&self, crate_name: &str) -> RailResult<Vec<String>>

Get transitive reverse dependencies (all workspace crates that depend on this one).

Uses petgraph DFS for efficient traversal.

Performance

O(V + E) where V = vertices, E = edges. Typically <10ms for <100 crates.

pub fn transitive_dependents_of_set( &self, crate_names: &HashSet<String>, ) -> RailResult<HashSet<String>>

Get transitive reverse dependencies for multiple crates in a single traversal.

This is more efficient than calling transitive_dependents() multiple times when you have many direct crates, as it does a single O(V+E) traversal instead of O(N × (V+E)) where N is the number of crates.

Performance

O(V + E) regardless of input set size. Significantly faster than N separate traversals for large input sets.

pub fn publish_order(&self) -> RailResult<Vec<String>>

Get workspace members in dependency order (dependencies first, dependents last).

Returns crates in the order they should be published: a crate’s dependencies are always published before the crate itself.

Uses topological sort on the dependency graph to ensure correct ordering.

Errors

Returns error if circular dependencies are detected (should never happen with Cargo).

Performance

O(V + E) where V = vertices, E = edges. Typically <10ms for <100 crates.

pub fn file_to_crate(&self, file_path: &Path) -> Option<String>

Map a file path to its owning crate.

O(1) lookups using pre-built path cache. Filters out VCS directories (.git, .jj) and other non-source paths.

Accepts both:

• Workspace-relative paths (e.g., “crates/foo/src/lib.rs”)
• Absolute paths (will be converted to workspace-relative)

Works for deleted files - does not require the file to exist on disk.

pub fn files_to_crates( &self, file_paths: &[impl AsRef<Path>], ) -> HashSet<String>

Map multiple files to owning crates.