Discrete Mathsfor Engineers

Structures, proofs, and intuition

EN | PT

Graph Theory → Foundations

Part 4 of 11 — Directed Graph

Series: Foundations Part 4 of 11
1 2 3 4 5 6 7 8 9 10 11

Intuition

A directed graph is a set of vertices connected by edges that have a direction.

Formally, each edge represents an ordered pair of vertices, indicating the source and the destination.

A B C D E
Example of a directed graph (digraph) with five vertices.