Struct RelationGraph 

pub struct RelationGraph {
    pub edges: Vec<RelationEdge>,
}

A relation graph connecting allocations.

Fields

edges: Vec<RelationEdge>

All edges in the graph.

Implementations

impl RelationGraph

pub fn new() -> Self

Create a new empty relation graph.

pub fn from_view(view: &MemoryView) -> Self

Build relation graph from MemoryView.

Creates a relation graph from the allocations in a MemoryView. This is a convenience method for the unified analyzer API.

pub fn add_edge(&mut self, from: usize, to: usize, relation: Relation)

Add a single edge to the graph.

Does not add duplicate edges (same from/to/relation).

pub fn add_edges(&mut self, edges: Vec<RelationEdge>)

Add multiple edges at once.

pub fn get_inbound_edges(&self, node: usize) -> Vec<&RelationEdge>

Get all inbound edges to a given node.

pub fn get_outbound_edges(&self, node: usize) -> Vec<&RelationEdge>

Get all outbound edges from a given node.

pub fn edge_count(&self) -> usize

Get the number of edges in the graph.

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

Get all unique node IDs referenced in the graph.

pub fn detect_cycles(&self) -> Vec<(usize, usize, Relation)>

Detect cycles in the relation graph using DFS.

Returns a list of cycle edges as (from, to, relation) tuples. Empty result means no cycles detected.

Trait Implementations

impl Clone for RelationGraph

fn clone(&self) -> RelationGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RelationGraph

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

Formats the value using the given formatter.

impl Default for RelationGraph

fn default() -> RelationGraph

Returns the “default value” for a type.