Struct ReifiedGraph 

pub struct ReifiedGraph<T> {
    pub nodes: Vec<(NodeId, T)>,
    pub edges: Vec<(NodeId, NodeId)>,
    pub root: NodeId,
}

An adjacency-list representation of a pointer graph.

Contains all nodes with their data, directed edges between nodes, and the identifier of the root node.

Examples

use reify_graph::{ReifiedGraph, NodeId};

let graph = ReifiedGraph {
    nodes: vec![(NodeId(0), "root"), (NodeId(1), "child")],
    edges: vec![(NodeId(0), NodeId(1))],
    root: NodeId(0),
};
assert_eq!(graph.nodes.len(), 2);

Fields

nodes: Vec<(NodeId, T)>

The nodes in the graph, each paired with its stable identifier.

edges: Vec<(NodeId, NodeId)>

Directed edges from parent to child.

root: NodeId

The root node’s identifier.

Trait Implementations

impl<T> Clone for ReifiedGraph<T>

where T: Clone,

fn clone(&self) -> ReifiedGraph<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T> Debug for ReifiedGraph<T>

where T: Debug,

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

Formats the value using the given formatter.

impl<'de, T> Deserialize<'de> for ReifiedGraph<T>

where T: Deserialize<'de>,

fn deserialize<__D>( __deserializer: __D, ) -> Result<ReifiedGraph<T>, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T> Serialize for ReifiedGraph<T>

where T: Serialize,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.