liveBook · Manning

Directed acyclic graph

As explained in Machine Learning Platform Engineering

A directed acyclic graph is a graph whose directed edges connect nodes without forming any cycle.

A directed acyclic graph (DAG) connects nodes with one-way edges and contains no cycles. In an ML pipeline, it orders tasks and runs each task only after its dependencies complete. section 5.1.2

A Kubeflow pipeline uses the DAG to:

  • Represent components as executable tasks. section 5.1.2
  • Enforce dependencies by passing one task's output into another task's input. section 5.1.2

Income classifier pipeline

Four tasks fetch data, retrieve features, run inference, and write results. The feature task consumes fetch_data_task.outputs["data_output"], and inference consumes the feature task's output.

How Machine Learning Platform Engineering covers it

How deep it goes
Defines directed edges and acyclicity, then implements task wiring and compilation without detailing scheduling internals.
Examples
Uses an income classifier with fetch-data, feature-retrieval, inference, and write-data tasks.
What it assumes
Assumes Python-defined components and basic Kubeflow Pipeline concepts.
What you can do after
Build and compile a Kubeflow pipeline by loading components, connecting task outputs, and generating YAML.
How it connects
Connects Kubeflow pipelines, pipeline components, task dependencies, and task outputs.

Also explained in

Compare how 15 books explain directed acyclic graph →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Machine Learning Platform Engineering. The section links point to the parts of the book it draws on.