tiny-dag 0.0.1

Mimimal DAG implementation with Python

Tiny DAG

Bare bones implementation of computation (directed, acyclic) graph for Python.

Requirements

• Python >= 3.6
• graphviz

Usage example

from tinydag.graph import Graph
from tinydag.node import Node

add = lambda a, b: a + b
mul = lambda a, b: a * b
div = lambda a, b: a / b

nodes = [
    Node(["add1", "x"], add, "add2"),
    Node(["add1", "add2"], mul, "mul"),
    Node(["x", "y"], add, "add1"),
    Node(["mul", "z"], div, "div"),
]
graph = Graph(nodes)
graph.render()
data = {"x": 5, "y": 3, "z": 3}
results = graph.calculate(data)

render method produces following figure: