5018 - Graph (Directed)
Last Update: 26.06.2025
Maturity  | |
|---|---|
 Basic |  |
 Scope |  |
 Flow | |
 Cycle | |
 To Center | Sink |
 To Periphery | Source |
A directed graph is a set of vertices connected by directed edges. A sink is a vertex with no outgoing edges, while a source is a vertex with no incoming edges.
WARNING: This entry is marked as experimental/in development.