Struct PetCodeGraph 

pub struct PetCodeGraph { /* private fields */ }

A petgraph-based code graph for efficient traversal and graph algorithms.

This implementation uses petgraph::StableGraph which:

• Supports O(1) neighbor access via adjacency lists
• Provides stable indices (node/edge removal doesn’t invalidate others)
• Enables built-in graph algorithms (BFS, DFS, topological sort, etc.)

Use this for runtime operations that require graph traversal.

Implementations

impl PetCodeGraph

pub fn new() -> Self

Create a new empty petgraph-based code graph

pub fn schema_version(&self) -> &str

Get the schema version

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

Add a node to the graph, returning its NodeIndex.

If a node with the same ID already exists, it will be replaced.

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

Get a node by its string ID

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

Get a mutable node by its string ID

pub fn get_node_by_index(&self, idx: NodeIndex) -> Option<&Node>

Get a node by its NodeIndex

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

Get the NodeIndex for a node ID

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

Check if the graph contains a node with the given ID

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

Remove a node and all its incident edges

pub fn node_count(&self) -> usize

Get the number of nodes

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

Iterate over all nodes

pub fn nodes_by_type(&self, node_type: NodeType) -> impl Iterator<Item = &Node>

Get nodes by type

pub fn add_edge( &mut self, source_id: &str, target_id: &str, data: EdgeData, ) -> Option<EdgeIndex>

Add an edge between two nodes by their string IDs.

Returns Some(EdgeIndex) if both nodes exist, None otherwise.

pub fn add_edge_from_struct(&mut self, edge: &Edge) -> Option<EdgeIndex>

Add an edge using an Edge struct.

Returns Some(EdgeIndex) if both nodes exist, None otherwise.

pub fn add_edge_by_index( &mut self, source: NodeIndex, target: NodeIndex, data: EdgeData, ) -> EdgeIndex

Add an edge using NodeIndices directly

pub fn incoming_edges( &self, id: &str, ) -> impl Iterator<Item = (&Node, &EdgeData)>

Get all incoming edges for a node (edges where this node is the target)

pub fn outgoing_edges( &self, id: &str, ) -> impl Iterator<Item = (&Node, &EdgeData)>

Get all outgoing edges from a node (edges where this node is the source)

pub fn edge_count(&self) -> usize

Get the number of edges

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

Iterate over all edges, returning Edge structs.

Note: This creates Edge structs on-the-fly. For performance-critical code, consider using edges_by_type() or outgoing_edges() instead.

pub fn edges_by_type( &self, edge_type: EdgeType, ) -> impl Iterator<Item = (&Node, &Node, &EdgeData)>

Get edges by type

pub fn neighbors(&self, id: &str) -> impl Iterator<Item = &Node>

Get all neighbor nodes (both incoming and outgoing)

pub fn children(&self, id: &str) -> impl Iterator<Item = &Node>

Get children (outgoing CONTAINS edges)

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

Get parent (incoming CONTAINS edge) - typically only one

pub fn remove_file_nodes(&mut self, file_path: &str)

Remove all nodes from a file and their incident edges

pub fn inner(&self) -> &StableGraph<Node, EdgeData, Directed>

Get a reference to the underlying petgraph

pub fn inner_mut(&mut self) -> &mut StableGraph<Node, EdgeData, Directed>

Get a mutable reference to the underlying petgraph

pub fn node_index_map(&self) -> &HashMap<String, NodeIndex>

Get a reference to the node index map

Trait Implementations

impl Clone for PetCodeGraph

fn clone(&self) -> PetCodeGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PetCodeGraph

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

Formats the value using the given formatter.

impl Default for PetCodeGraph

fn default() -> Self

Returns the “default value” for a type.