Canonical: https://knowlpedia.com/discrete-structures/directed-graph/

# Directed graph

A vertex set equipped with a specified set of ordered edges.

A **directed graph** is a pair \(G=(V,E)\) with \(E\subseteq V\times V\). An [ordered edge](https://knowlpedia.com/shared-foundations/ordered-pair/) \((u,v)\), written \(u\to v\), has source \(u\) and target \(v\). This convention allows loops and allows both \(u\to v\) and \(v\to u\); additional hypotheses can exclude them. There are no parallel copies of an edge when \(E\) is a set.

## Paths

[Directed paths](https://knowlpedia.com/discrete-structures/directed-path/) follow successive arrows; a [directed cycle](https://knowlpedia.com/discrete-structures/directed-cycle/) returns to its starting vertex. Edge orientation must be stated when the graph describes dependencies: “requires” and “is used by” give opposite conventions.
