Project Links Logo Artwork
Graph Theory: Networking
Home > Graph Theory: Networking > Foundations > Directed Graphs
Crib Sheet
Library
Help
Map
Problem List
Module Home
Links Home


conceptsdiscoverapplycollaboratepractice
 
 
go backgo forward
go backgo forward

Directed Graphs

Many applications of graph theory require a definition of a graph for which edges are directed: allowing there to be an edge from to but not necessarily an edge from to .

Here is a formal definition:

A directed graph (often called a digraph for brevity's sake) is a pair where is a set of elements called vertices and is a subset of the set of all ordered pairs , where and are vertices. (An element of is called an edge of ). For more information on edges and vertices please click here

Example


Figure 2:





A directed graph with and can be drawn as shown here.

 
 
go backgo forward
go backgo forward