Skip to content

Glossary: Algorithms Beyond the Basics in Go

Directed graph

Also written: directed edge

A graph whose edges have a direction, like "roast before rest", so an edge from A to B does not imply one from B to A. It is used to store ordering rules between tasks.

Where the book teaches it

Related terms

DAG (directed acyclic graph)Vertex and edge