Method remove_node

core/src/graph/workflow_graph.rs:212–255

Remove a node from the graph

(&mut self, node_id: &NodeId)

    /// Remove a node from the graph
    pub fn remove_node(&mut self, node_id: &NodeId) -> GraphBitResult<()> {
        if self.nodes.remove(node_id).is_none() {
            return Err(GraphBitError::graph(format!("Node {node_id} not found")));
        }

        // Remove edges involving this node
        self.edges
            .retain(|(from, to, _)| from != node_id && to != node_id);

        // Update adjacency maps incrementally for the removed node.
        // Remove any outgoing entries for this node and drop this node from predecessors.
        if let Some(successors) = self.outgoing.remove(node_id) {
            for successor in successors {
                if let Some(predecessors) = self.incoming.get_mut(&successor) {
                    predecessors.retain(|source| source != node_id);
                    if predecessors.is_empty() {
                        self.incoming.remove(&successor);
                    }
                }
            }
        }

        // Remove any incoming entries for this node and drop this node from successors.
        if let Some(predecessors) = self.incoming.remove(node_id) {
            for predecessor in predecessors {
                if let Some(successors) = self.outgoing.get_mut(&predecessor) {
                    successors.retain(|target| target != node_id);
                    if successors.is_empty() {
                        self.outgoing.remove(&predecessor);
                    }
                }
            }
        }

        // Rebuild full graph/index structures to avoid stale NodeIndex entries
        self.rebuild_petgraph_and_id_maps()?;
        self.refresh_adjacency_from_edges();
        self.rebuild_name_map_from_nodes();

        // Invalidate caches since graph structure changed
        self.invalidate_caches();

        Ok(())
    }

    /// Get a node by ID
    #[inline]