Concepts

Glossary

qianmoQqianmoQ· 更新于 2026-10-09· 阅读 6 分钟· 0 次阅读

登录后可跨设备保存划线和私人笔记登录

Glossary

Before we dive into the concepts, let’s clarify the terminology we’ll be using:

Directed Acyclic Graph (DAG)A directed acyclic graph is a computer science/mathematics term for representing the world with “nodes” and “edges”, where “edges” only flow in one direction. It is called a graph because it can be drawn and visualized.
DataflowThe organization of functions and dependencies. This is a DAG – it’s directed (one function is running before the other), acyclic, (there are no cycles, i.e., no function runs before itself), and a graph (it is easily naturally represented by nodes and edges) and can be represented visually. See Functions, nodes & dataflow.
Node \Hamilton node \TransformA single step in the dataflow DAG representing a computation – usually 1:1 with functions but decorators break that pattern – in which case multiple transforms trace back to a single function. See Functions, nodes & dataflow.
Function \Python function \Hamilton function \Node definitionA Python function written by a user to create a single node (in the standard case) or many (using function modifiers). See Functions, nodes & dataflow.
Module \Python modulePython code organized into a .py file. These are natural groupings of functions that turn to a set of nodes. See Code Organization for more details.
Driver \Hamilton DriverAn object that loads Python modules to build a dataflow. It is responsible for visualizing and executing the dataflow. See Driver.
script \runner \driver codeThe piece of code where you create the Driver and execute the dataflow to get results.
ConfigData that dictates the way the DAG is constructed. See Driver.
Function modifiers \DecoratorsA function that modifies how your Hamilton function is compiled into a Hamilton node. See Function modifiers.

评论

登录后参与评论

正在加载评论…