Struct IndexedSubgraph 

pub struct IndexedSubgraph {
    pub nodes: HashMap<Nulid, Node>,
    pub edges: HashMap<Nulid, Edge>,
    pub outgoing: HashMap<Nulid, Vec<usize>>,
    pub edge_list: Vec<Edge>,
}

Indexed form of a Subgraph for efficient traversal.

Built once via IndexedSubgraph::from_subgraph and then passed to the detection functions.

Fields

nodes: HashMap<Nulid, Node>

All nodes keyed by their NULID.

edges: HashMap<Nulid, Edge>

All edges keyed by their NULID.

outgoing: HashMap<Nulid, Vec<usize>>

Outgoing adjacency list: source node ID -> list of edge indices (referencing Self::edge_list).

edge_list: Vec<Edge>

Flat edge list for index-based access.

Implementations

impl IndexedSubgraph

pub fn from_subgraph(sg: &Subgraph) -> Self

Build an indexed subgraph from the raw deserialized input.

pub fn outgoing_edges(&self, node_id: Nulid) -> &[usize]

Return outgoing edges for a given node ID.

pub fn node_label(&self, node_id: Nulid) -> Option<&str>

Return the label of a node, or None if not in the subgraph.

Trait Implementations

impl Debug for IndexedSubgraph

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

Formats the value using the given formatter.