Struct DependencyGraphInput 

pub struct DependencyGraphInput {
    pub nodes: Vec<NodeInput>,
    pub edges: Vec<EdgeInput>,
}

Input graph for pure-compute functions.

Examples

use sdivi_core::input::{DependencyGraphInput, NodeInput, EdgeInput};

let g = DependencyGraphInput { nodes: vec![], edges: vec![] };
assert_eq!(g.nodes.len(), 0);

Fields

nodes: Vec<NodeInput>

All nodes; order determines 0-based numeric indices used in edges.

edges: Vec<EdgeInput>

All directed edges referencing node IDs.

Trait Implementations

impl Clone for DependencyGraphInput

fn clone(&self) -> DependencyGraphInput

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DependencyGraphInput

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for DependencyGraphInput

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for DependencyGraphInput

fn eq(&self, other: &DependencyGraphInput) -> 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 DependencyGraphInput

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 DependencyGraphInput