previous up next
Go backward to
Go up to Top
Go forward to Example
RISC-Linz logo

Directed Graphs

Definition: A directed graph is a pair <V, E> of a set V of vertices/  nodes and a set of E of edges/ arcs where E is binary relation on V:

G is directed graph : <=>
   exists V, E:
      G = <V, E> /\ 
      E subset V x V.

Interpretation: <x, y> in E

Author: Wolfgang Schreiner
Last Modification: January 26, 2000

previous up next