Struct CourseGraph 

pub struct CourseGraph {
    pub graph: DiGraph<CourseNode, ()>,
    pub node_map: HashMap<String, NodeIndex>,
}

Fields

graph: DiGraph<CourseNode, ()>

node_map: HashMap<String, NodeIndex>

Implementations

impl CourseGraph

pub fn new() -> Self

pub fn add_node(&mut self, doc: &Document) -> NodeIndex

Add a document as a node to the graph

pub fn add_edge(&mut self, prerequisite_id: &str, course_id: &str) -> Result<()>

Add an edge between two nodes (prerequisite -> course)

pub fn get_node(&self, id: &str) -> Option<&CourseNode>

Get a node by its ID

pub fn nodes(&self) -> impl Iterator<Item = (NodeIndex, &CourseNode)>

Get all nodes in the graph

pub fn edges(&self) -> impl Iterator<Item = (NodeIndex, NodeIndex)> + '_

Get all edges in the graph

pub fn has_cycles(&self) -> bool

Check if the graph has cycles

pub fn topological_sort(&self) -> Result<Vec<NodeIndex>>

Get nodes in topological order (if the graph is acyclic)

pub fn node_count(&self) -> usize

Get the number of nodes

pub fn edge_count(&self) -> usize

Get the number of edges

pub fn find_root_nodes(&self) -> Vec<NodeIndex>

Find nodes with no prerequisites (root nodes)

pub fn find_leaf_nodes(&self) -> Vec<NodeIndex>

Find nodes with no dependents (leaf nodes)

Trait Implementations

impl Clone for CourseGraph

fn clone(&self) -> CourseGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CourseGraph

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

Formats the value using the given formatter.

impl Default for CourseGraph

fn default() -> Self

Returns the “default value” for a type.