Struct QueryDag 

pub struct QueryDag { /* private fields */ }

A Directed Acyclic Graph representing a query plan

Implementations

impl QueryDag

pub fn new() -> Self

Create a new empty DAG

pub fn add_node(&mut self, node: OperatorNode) -> usize

Add a node to the DAG, returns the node ID

pub fn add_edge(&mut self, parent: usize, child: usize) -> Result<(), DagError>

Add an edge from parent to child

pub fn remove_node(&mut self, id: usize) -> Option<OperatorNode>

Remove a node from the DAG

pub fn get_node(&self, id: usize) -> Option<&OperatorNode>

Get a reference to a node

pub fn get_node_mut(&mut self, id: usize) -> Option<&mut OperatorNode>

Get a mutable reference to a node

pub fn children(&self, id: usize) -> &[usize]

Get children of a node

pub fn parents(&self, id: usize) -> &[usize]

Get parents of a node

pub fn root(&self) -> Option<usize>

Get the root node ID

pub fn leaves(&self) -> Vec<usize>

Get all leaf nodes (nodes with no children)

pub fn node_count(&self) -> usize

Get the number of nodes

pub fn edge_count(&self) -> usize

Get the number of edges

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

Get iterator over node IDs

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

Get iterator over all nodes

pub fn compute_depths(&self) -> HashMap<usize, usize>

Compute depth of each node from leaves (leaves have depth 0)

pub fn ancestors(&self, id: usize) -> HashSet<usize>

Get all ancestors of a node

pub fn descendants(&self, id: usize) -> HashSet<usize>

Get all descendants of a node

pub fn topological_sort(&self) -> Result<Vec<usize>, DagError>

Return nodes in topological order as Vec (dependencies first)

impl QueryDag

pub fn topological_iter(&self) -> Result<TopologicalIterator<'_>, DagError>

Create an iterator for topological order traversal

pub fn dfs_iter(&self, start: usize) -> DfsIterator<'_>

Create an iterator for depth-first search starting from a node

pub fn bfs_iter(&self, start: usize) -> BfsIterator<'_>

Create an iterator for breadth-first search starting from a node

Trait Implementations

impl Clone for QueryDag

fn clone(&self) -> QueryDag

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl DagDeserializer for QueryDag

fn from_json(json: &str) -> Result<Self, Error>

Deserialize from JSON string

fn from_bytes(bytes: &[u8]) -> Result<Self, DagError>

Deserialize from bytes

impl DagSerializer for QueryDag

fn to_json(&self) -> Result<String, Error>

Serialize to JSON string

fn to_bytes(&self) -> Vec<u8>

Serialize to bytes (using bincode-like format via JSON for now)

impl Debug for QueryDag

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

Formats the value using the given formatter.

impl Default for QueryDag

fn default() -> Self

Returns the “default value” for a type.