Struct ReqTree 

pub struct ReqTree { /* private fields */ }

Implementations

impl ReqTree

pub fn new() -> Self

pub fn insert(&mut self, req: Requirement)

Insert a requirement

pub fn get(&self, name: &str) -> Option<&Requirement>

pub fn prereqs(&self, name: &str) -> Option<&[String]>

Retrieve direct prereqs as names

pub fn dependents(&self, name: &str) -> Option<&HashSet<String>>

Retrieve direct dependents as names

pub fn all_prereqs(&self, name: &str) -> HashSet<String>

All transitive prereqs via BFS

pub fn all_dependents(&self, name: &str) -> HashSet<String>

All transitive dependents via BFS

pub fn find_cycle(&self) -> Option<Vec<String>>

Check for any cycles (shoudl be invalid for deep anyways)