Struct Subgraph 

pub struct Subgraph {
    pub nodes: Vec<TraversedNode>,
    pub edges: Vec<TraversedEdge>,
}

A discovered subgraph: nodes in BFS first-discovery order plus the projection edges among them.

Nodes are unique by canonical element. Edges connect two discovered nodes and are unique by canonical relation, ordered by ascending (source, target, relation).

Performance

Iterating nodes or edges is O(node count) / O(edge count).

Fields

nodes: Vec<TraversedNode>

Discovered nodes in BFS first-discovery order.

edges: Vec<TraversedEdge>

Edges connecting two discovered nodes.

Implementations

impl Subgraph

pub fn nodes(&self) -> &[TraversedNode]

Returns the discovered nodes.

Performance

This method is O(1).

pub fn edges(&self) -> &[TraversedEdge]

Returns the traversed edges.

Performance

This method is O(1).

Trait Implementations

impl Clone for Subgraph

fn clone(&self) -> Subgraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Subgraph

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

Formats the value using the given formatter.

impl Default for Subgraph

fn default() -> Subgraph

Returns the “default value” for a type.

impl Eq for Subgraph

impl PartialEq for Subgraph

fn eq(&self, other: &Subgraph) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for Subgraph