Struct Graph 

pub struct Graph {
    pub nodes: HashMap<String, Node>,
    pub edges: Vec<Edge>,
    pub forward: HashMap<String, Vec<usize>>,
    pub reverse: HashMap<String, Vec<usize>>,
    pub child_graphs: Vec<String>,
    pub interface: Vec<String>,
}

Fields

nodes: HashMap<String, Node>

edges: Vec<Edge>

forward: HashMap<String, Vec<usize>>

reverse: HashMap<String, Vec<usize>>

child_graphs: Vec<String>

interface: Vec<String>

Resolved interface nodes from config (empty = open graph).

Implementations

impl Graph

pub fn new() -> Self

pub fn children(&self) -> impl Iterator<Item = &Node>

Child graphs (nodes with type Graph).

pub fn is_interfaced(&self, path: &str) -> bool

Whether a node is part of this graph’s interface.

pub fn add_node(&mut self, node: Node)

pub fn is_file_node(&self, path: &str) -> bool

Returns true for Source and Resource nodes (excludes External and Graph). Used by structural analyses that operate only on file-backed nodes.

pub fn add_edge(&mut self, edge: Edge)

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() -> Graph

Returns the “default value” for a type.