Struct CellGraph 

pub struct CellGraph { /* private fields */ }

Directed acyclic graph tracking cell dependencies.

Implementations

impl CellGraph

pub fn new() -> Self

Create a new empty cell graph.

pub fn add_cell(&mut self, source: impl Into<String>) -> CellId

Add a new cell to the graph.

pub fn update_cell( &mut self, id: CellId, source: impl Into<String>, ) -> HashSet<CellId>

Update a cell’s source code.

Returns the set of cells that need re-execution.

pub fn remove_cell(&mut self, id: CellId) -> Option<Cell>

Remove a cell from the graph.

pub fn get_cell(&self, id: CellId) -> Option<&Cell>

Get a cell by ID.

pub fn get_cell_mut(&mut self, id: CellId) -> Option<&mut Cell>

Get a mutable reference to a cell.

pub fn cells(&self) -> impl Iterator<Item = &Cell>

Get all cells.

pub fn len(&self) -> usize

Get the number of cells.

pub fn is_empty(&self) -> bool

Check if the graph is empty.

pub fn topological_order(&self) -> Option<Vec<CellId>>

Get cells in topological order based on dependencies.

Returns None if there’s a cycle.

pub fn cells_to_execute(&self) -> Vec<CellId>

Get cells that need execution (dirty cells in topological order).

Trait Implementations

impl Debug for CellGraph

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

Formats the value using the given formatter.

impl Default for CellGraph

fn default() -> CellGraph

Returns the “default value” for a type.