Gantz is a programming execution representation.
Gantz uses a directed graph for this representation. Nodes represent expressions, while the edges between nodes define the order of evaluation for each of these expressions.
- Inlets of a node describe the inputs to the expression.
- Outlets of a node describe the outputs of the evaluated expression.
Gantz allows for triggering evaluation of the graph in two ways:
Push evaluation. The graph allows for "pushing" evaluation from one or more outlets of a single node. This causes the "pushed" outlets to begin evaluation in visit-order of a breadth-first-search that ends when nodes are reached that either 1. only have outlets connecting to nodes that have already been evaluated or 2. have no outlets at all.
Pull evaluation. The graph allows for "pulling" evaluation from one or more inlets of a single node. This causes the "pulled" inlets to perform a depth-first search in order to find all connected nodes that either 1. Have no inlets or 2. have inlets that connect to already visited nodes. Once these "starting" nodes are found, evaluation is "pushed" from each of these nodes in the order in which they were visited.
The edge connecting two nodes.
The graph type
The index type used within the graph to uniquely identify a node or edge.
The petgraph graph data structure used to represent the execution graph.