Directed graph

A directed graph is a set of vertices connected by edges that each run from a specified source vertex to a specified destination vertex. Its edges encode ordered relationships.

Graph theory: The mathematical study of graphs and their properties. Directed graphs are one of the central structures studied in graph theory.
Directed path: A sequence of vertices joined by edges that point successively from each vertex to the next. It defines how movement through a directed graph must follow edge orientations.
Dependency graph: A directed graph in which edges represent dependency relationships among tasks or components. An edge can point from a prerequisite to the task that depends on it.
Directed acyclic graph: A directed graph containing no directed cycles. It is a restricted form where edge directions permit a topological ordering.
Vertex (graph theory): A vertex is a point in a graph representing an entity or state. Each directed edge begins and ends at vertices.
Directed cycle: A directed path that returns to its starting vertex without repeating other vertices. Cycles show when following edge directions can return to an earlier state.
Finite-state machine: A computational model with finitely many states and transitions between them. Its states and directed transitions form a graph of possible behavior.
Multigraph: A graph that can contain multiple edges connecting the same pair of vertices. Directed multigraphs allow several distinct arrows between the same ordered endpoints.
Edge (graph theory): An edge is a connection between vertices in a graph. Direction specifies how each edge connects its endpoint vertices.
Reachability: The property that one vertex can be reached from another by following edges or transitions. It captures which vertices are accessible while respecting edge directions.

Linked from 39 pages