daggy 0.9.0

A directed acyclic graph data structure library. It is Implemented on top of petgraph's Graph data structure and attempts to follow similar conventions where suitable.
Documentation 
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

use super::StableDag;
use petgraph::algo::DfsSpace;
use petgraph::graph::IndexType;
use serde::{Deserialize, Deserializer, Serialize, Serializer};

impl<N, E, Ix> Serialize for StableDag<N, E, Ix>
where
    N: Serialize,
    E: Serialize,
    Ix: IndexType + Serialize,
{
    fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
    where
        S: Serializer,
    {
        self.graph.serialize(serializer)
    }
}

impl<'de, N, E, Ix> Deserialize<'de> for StableDag<N, E, Ix>
where
    Self: Sized,
    N: Deserialize<'de>,
    E: Deserialize<'de>,
    Ix: IndexType + Deserialize<'de>,
{
    fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
    where
        D: Deserializer<'de>,
    {
        let graph = Deserialize::deserialize(deserializer)?;
        let cycle_state = DfsSpace::new(&graph);
        let dag = StableDag { graph, cycle_state };
        Ok(dag)
    }
}