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>>,
}

Fields

nodes: HashMap<String, Node>

edges: Vec<Edge>

forward: HashMap<String, Vec<usize>>

reverse: HashMap<String, Vec<usize>>

Implementations

impl Graph

pub fn new() -> Self

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

pub fn is_internal_edge(&self, edge: &Edge) -> bool

Returns true when the edge target is an included node in the graph.

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

pub fn included_nodes(&self) -> impl Iterator<Item = (&String, &Node)>

Iterate over nodes that match include patterns.

pub fn filter_by_parsers(&self, parsers: &[String]) -> Graph

Create a new graph containing only edges from the specified parsers. All nodes are preserved. Adjacency maps are rebuilt for the filtered edge set.

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.