Directed graph

From Algowiki
Jump to: navigation, search

Definition

A directed graph is a graph, where every edge has a direction. More precisely, a directed graph is a pair [math]G=(V,A)[/math], where [math]V[/math] represents a set of nodes and [math]A[/math] a set of arcs. Arcs are ordered pairs of nodes in contrast to unordered pairs of nodes (called edges) in an undirected graph. An arc [math]a = (v, w)[/math] is considered to be directed from [math]v[/math] to [math]w[/math].