Struct SubGraph 

pub struct SubGraph {
    pub nodes: Vec<u64>,
    pub edges: Vec<(u64, u64, f32)>,
}

Subgraph representation

Fields

nodes: Vec<u64>

Node IDs in the subgraph

edges: Vec<(u64, u64, f32)>

Edges as (from, to, weight) tuples

Implementations

impl SubGraph

pub fn new() -> Self

Create a new empty subgraph

pub fn with_edges(nodes: Vec<u64>, edges: Vec<(u64, u64, f32)>) -> Self

Create subgraph with nodes and edges

pub fn node_count(&self) -> usize

Get number of nodes

pub fn edge_count(&self) -> usize

Get number of edges

pub fn contains_node(&self, node_id: u64) -> bool

Check if subgraph contains a node

pub fn average_edge_weight(&self) -> f32

Get average edge weight

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

Returns the “default value” for a type.

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