Directed Graph

A directed graph (DG) g is a graph g = $ \langle$G,V$ \rangle$, but here the edges E are given as a set of ordered pairs like E = {(v,v')$ \mid$ (v, v') $ in$ V $ \times$ V}. This kind of edges is called arcs. An arc is written as v $ \rightarrow$ v'. In an arc v $ \rightarrow$ v' is v called the predecessor of v' and v' is called the successor of v.



Gerd Doeben-Henisch 2010-03-03