Struct SubGraph 

pub struct SubGraph {
    pub nodes: Vec<SubGraphNode>,
    pub edges: Vec<SubGraphEdge>,
}

Result of a graph traversal (BFS/DFS).

Fields

nodes: Vec<SubGraphNode>

Nodes discovered during traversal, keyed by node ID.

edges: Vec<SubGraphEdge>

Edges traversed.

Implementations

impl SubGraph

pub fn empty() -> Self

Empty subgraph.

pub fn node_count(&self) -> usize

Number of nodes in the subgraph.

pub fn edge_count(&self) -> usize

Number of edges in the subgraph.

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<'de> Deserialize<'de> for SubGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

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 Serialize for SubGraph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for SubGraph