Struct DependencyGraph 

pub struct DependencyGraph { /* private fields */ }

A blocker edge points from the prerequisite to the issue waiting on it.

Implementations

impl DependencyGraph

pub fn from_issues(issues: &[(String, IssueHeading)]) -> Result<Self>

Build a graph and reject malformed duplicate IDs or cyclic dependencies.

Errors

Returns an error if two headings share an id, an issue blocks itself, or the blocker edges form a cycle.

pub fn from_headings<'a, I>(issues: I) -> Result<Self>

where I: IntoIterator<Item = &'a IssueHeading>,

Same graph as Self::from_issues, without copying headings.

Errors

Returns an error if two headings share an id, an issue blocks itself, or the blocker edges form a cycle.

pub fn accepts_edge(&self, blocker: &str, issue: &str) -> Result<(), Error>

Validate a prospective blocker insertion without mutating the graph.

Unknown ids are accepted: a missing endpoint is not a cycle.

Errors

Returns an error if blocker is issue, or if adding the edge would close a loop.

pub fn topological_ids(&self) -> Result<Vec<String>>

Return a deterministic prerequisite-first order.

Errors

Returns an error if the graph contains a cycle.

pub fn ancestors( &self, issue: &str, depth: usize, ) -> Result<Vec<(usize, String)>, Error>

Return nodes that transitively block issue, bounded by hop depth.

Errors

Returns an error if issue is not in the graph.

pub fn descendants( &self, issue: &str, depth: usize, ) -> Result<Vec<(usize, String)>, Error>

Return nodes transitively waiting on issue, bounded by hop depth.

Errors

Returns an error if issue is not in the graph.

Trait Implementations

impl Debug for DependencyGraph

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

Formats the value using the given formatter.