rsdiff-graphs 0.0.2

Computational graphs for Rust
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

/*
    Appellation: dcg <module>
    Contrib: FL03 <jo3mccain@icloud.com>
*/
//! # Dynamic Compute Graph
//!
//! A computational graph forms the backbone of automatic differentiation. Computational graphs are directed acyclic graphs (DAGs)
//! that represent any computation as a series of nodes and edges.
pub use self::{edge::Edge, graph::Dcg, node::Node};

pub(crate) mod graph;

pub mod edge;
pub mod node;

pub(crate) type DynamicGraph<T> = petgraph::graph::DiGraph<node::Node<T>, edge::Edge>;

pub trait GraphData {
    type Value: ?Sized;
}

impl<S> GraphData for S
where
    S: rsdiff::prelude::Scalar<Real = S>,
{
    type Value = S;
}

#[cfg(test)]
mod tests {}