1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57

pub use crate::{
    Edge, EdgeStore, EdgeStoreData, HasEdgeStore, HasNodeStore, Meta, Metadata, Node, NodeStore,
    NodeStoreData,
};
use anyhow::Result;

/// A graph containing nodes and edges.
#[derive(Clone, Debug, Default, PartialEq)]
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
pub struct Graph {
    /// Instance metadata.
    pub metadata: Metadata,
    /// Node store.
    pub nodes: NodeStoreData,
    /// Edge store.
    pub edges: EdgeStoreData,
}

impl HasNodeStore for Graph {
    fn node_store(&self) -> &NodeStoreData {
        &self.nodes
    }
    fn node_store_mut(&mut self) -> &mut NodeStoreData {
        &mut self.nodes
    }
}
impl NodeStore for Graph {}
impl HasEdgeStore for Graph {
    fn edge_store(&self) -> &EdgeStoreData {
        &self.edges
    }
    fn edge_store_mut(&mut self) -> &mut EdgeStoreData {
        &mut self.edges
    }
}
impl EdgeStore for Graph {}

impl Graph {
    pub fn new(metadata: Option<Metadata>, nodes: Vec<Node>, edges: Vec<Edge>) -> Result<Self> {
        let mut node_store = NodeStoreData::default();
        node_store.extend_nodes(nodes, true)?;
        let mut edge_store = EdgeStoreData::default();
        edge_store.extend_edges(edges, true, Some(&node_store))?;
        let graph = Self {
            metadata: metadata.unwrap_or_default(),
            nodes: node_store,
            edges: edge_store,
        };
        Ok(graph)
    }
}

impl Meta for Graph {
    fn get_meta(&self) -> &Metadata {
        &self.metadata
    }
}