Struct GraphData 

pub struct GraphData {
    pub graph: DiGraph<Node, Edge>,
    pub node_indices: HashMap<String, NodeIndex>,
    pub nodes: HashMap<String, Node>,
    pub edges: Vec<Edge>,
}

Core graph data structure.

Wraps a petgraph DiGraph with lookup tables for efficient access. Supports runtime mutation (add/remove nodes and edges) without full rebuild.

Fields

graph: DiGraph<Node, Edge>

The underlying directed graph.

node_indices: HashMap<String, NodeIndex>

Lookup table: node ID → petgraph NodeIndex.

nodes: HashMap<String, Node>

Lookup table: node ID → Node data.

edges: Vec<Edge>

All edges as a flat list (for serialization).

Implementations

impl GraphData

pub fn prerequisites(&self, node_id: &str) -> Result<Vec<Node>>

Get direct prerequisites of a node (incoming Prerequisite edges).

pub fn dependents(&self, node_id: &str) -> Result<Vec<Node>>

Get nodes that depend on this node (outgoing Prerequisite edges pointing here).

pub fn related_by( &self, node_id: &str, relationship: &Relationship, ) -> Result<Vec<Node>>

Get nodes related by a specific relationship type (outgoing direction).

impl GraphData

pub fn new() -> Self

Creates an empty graph.

pub fn node_count(&self) -> usize

Returns the number of nodes.

pub fn edge_count(&self) -> usize

Returns the number of edges.

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

Gets a node by ID.

pub fn get_index(&self, id: &str) -> Option<NodeIndex>

Gets the petgraph NodeIndex for a node ID.

pub fn contains_node(&self, id: &str) -> bool

Checks if a node exists.

pub fn node_ids(&self) -> impl Iterator<Item = &str>

Returns an iterator over all node IDs.

pub fn iter_nodes(&self) -> impl Iterator<Item = &Node>

Returns an iterator over all nodes.

pub fn iter_edges(&self) -> impl Iterator<Item = &Edge>

Returns an iterator over all edges.

pub fn add_node(&mut self, node: Node) -> NodeIndex

Add a node to the graph at runtime.

Returns the NodeIndex for the newly added node. If a node with the same ID already exists, returns its existing index.

pub fn add_edge(&mut self, edge: Edge) -> Result<()>

Add an edge between two nodes identified by ID.

Both nodes must already exist in the graph. Returns Ok(()) on success, or an error if a node is missing.

pub fn remove_node(&mut self, id: &str) -> Option<Node>

Remove a node and all its connected edges.

Returns the removed node, or None if the node didn’t exist.

Trait Implementations

impl Clone for GraphData

fn clone(&self) -> GraphData

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphData

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

Formats the value using the given formatter.

impl Default for GraphData

fn default() -> Self

Returns the “default value” for a type.