Welcome to GraphEval’s documentation!
GraphEval is a project which aims to simplify the task of evaluating data. It is especially useful if similar tasks should be performed with only slight variations.
This works in three simple steps:
First, splitting the whole pipeline into a set of atomic steps, which are called nodes (for example “Do a linear regression”).
Compile the nodes to a graph, essentially plugging their in- and outputs together.
Request the result you want from the respective node.
The graph takes care of solving the dependencies (i.e. feeding every node with the required data) and eventually loading from and saving to cache. On top of that, results can also be visualized using the matplotlib wrapper proplot by giving every node the knowledge of how to add its results to a figure.
Nodes are inherited from grapheval.node.EvalNode
.
See there for a quick start.
- Nodes
EvalNode
EvalNode.__call__()
EvalNode.__contains__()
EvalNode.__getitem__()
EvalNode.common()
EvalNode.copy()
EvalNode.data
EvalNode.data_extra()
EvalNode.def_kwargs()
EvalNode.do()
EvalNode.get_color()
EvalNode.get_kwargs()
EvalNode.global_id
EvalNode.handles
EvalNode.handles_complete_tree
EvalNode.id
EvalNode.in_plot_group()
EvalNode.is_descendant_of()
EvalNode.is_parent()
EvalNode.map_parents()
EvalNode.map_tree()
EvalNode.parent_count
EvalNode.parents
EvalNode.parents_contains()
EvalNode.parents_iter
EvalNode.plot()
EvalNode.plot_on
EvalNode.search_parent()
EvalNode.search_parents_all()
EvalNode.search_tree()
EvalNode.search_tree_all()
EvalNode.set()
EvalNode.set_color()
EvalNode.subclass_init()
EvalNode.tree_kwargs()
- Callback Nodes
- Helper nodes
- Methods
- Cache
- NodeFigure
- Graph module