cognis-graph 0.3.1

Stateful graph engine for Cognis: typed Graph<S>, Pregel-style superstep executor, per-field reducers, interrupts, time-travel via checkpointers (in-memory, SQLite, Postgres), and streaming.
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

//! Render compiled graphs as Mermaid, GraphViz DOT, or ASCII diagrams
//! for docs / debugging.

pub mod ascii;
pub mod dot;
pub mod mermaid;

use std::collections::BTreeSet;

use crate::compiled::CompiledGraph;
use crate::state::GraphState;

/// A static-route edge `(from, to)`. Dynamic routing via `Goto::Send` /
/// `Goto::Multiple` only surfaces what the node *can* go to if the graph
/// builder declared it via [`crate::builder::Graph::edge`].
#[derive(Debug, Clone, PartialEq, Eq, Ord, PartialOrd)]
pub struct Edge {
    /// Source node name.
    pub from: String,
    /// Destination node name (or `__END__`).
    pub to: String,
}

/// Extract the static edges declared on the graph (via `edge(from, to)`).
/// Used by both renderers.
pub(crate) fn extract_edges<S: GraphState>(g: &CompiledGraph<S>) -> Vec<Edge> {
    let mut set: BTreeSet<Edge> = BTreeSet::new();
    for (from, to) in &g.graph.edges {
        set.insert(Edge {
            from: from.clone(),
            to: to.clone(),
        });
    }
    set.into_iter().collect()
}