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;
pub use self::node::Node;