Struct Graph 

pub struct Graph { /* private fields */ }

Opaque handle to an interactive graph.

Create with Graph::new(). The graph can be used programmatically to build and inspect node/edge structures.

This type implements Drop to release the underlying SDK resource. It is move-only (not cloneable).

Implementations

impl Graph

pub fn new() -> Self

Create a new empty graph.

pub fn add_node(&mut self) -> NodeId

Add a node to the graph. Returns the new node ID.

pub fn remove_node(&mut self, node: NodeId) -> Status

Remove a node and all its incident edges.

pub fn total_node_count(&self) -> i32

Total number of nodes (including group/hidden nodes).

pub fn visible_node_count(&self) -> i32

Number of visible (non-hidden) nodes.

pub fn node_exists(&self, node: NodeId) -> bool

Check if a node exists and is visible.

pub fn add_edge(&mut self, source: NodeId, target: NodeId) -> Status

Add a directed edge from source to target.

pub fn add_edge_with_info( &mut self, source: NodeId, target: NodeId, info: EdgeInfo, ) -> Status

Add a directed edge with visual properties.

pub fn remove_edge(&mut self, source: NodeId, target: NodeId) -> Status

Remove a directed edge.

pub fn replace_edge( &mut self, from: NodeId, to: NodeId, new_from: NodeId, new_to: NodeId, ) -> Status

Replace edge (from, to) with (new_from, new_to).

pub fn successors(&self, node: NodeId) -> Result<Vec<NodeId>>

Get successor node IDs for a node.

pub fn predecessors(&self, node: NodeId) -> Result<Vec<NodeId>>

Get predecessor node IDs for a node.

pub fn visible_nodes(&self) -> Result<Vec<NodeId>>

Get all visible node IDs.

pub fn edges(&self) -> Result<Vec<Edge>>

Get all edges.

pub fn path_exists(&self, source: NodeId, target: NodeId) -> bool

Check if a path exists from source to target.

pub fn create_group(&mut self, nodes: &[NodeId]) -> Result<NodeId>

Create a group containing the given nodes.

pub fn delete_group(&mut self, group: NodeId) -> Status

Delete a group node but keep its member nodes.

pub fn set_group_expanded(&mut self, group: NodeId, expanded: bool) -> Status

Expand (show contents) or collapse (hide contents) a group.

pub fn is_group(&self, node: NodeId) -> bool

Check if a node is a group node.

pub fn is_collapsed(&self, group: NodeId) -> bool

Check if a group node is collapsed.

pub fn group_members(&self, group: NodeId) -> Result<Vec<NodeId>>

Get the member nodes of a group.

pub fn set_layout(&mut self, layout: Layout) -> Status

Set the layout algorithm and recompute.

pub fn current_layout(&self) -> Layout

Return the currently selected layout algorithm.

pub fn redo_layout(&mut self) -> Status

Recompute the current layout.

pub fn clear(&mut self) -> Status

Clear all nodes and edges.

Trait Implementations

impl Debug for Graph

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

Formats the value using the given formatter.

impl Default for Graph

fn default() -> Self

Returns the “default value” for a type.

impl Drop for Graph

fn drop(&mut self)

Executes the destructor for this type.

impl Send for Graph