digraph

A directed graph is a network in which each edge is specified as going in a particular direction.

A graph in which each graph edge is replaced by a directed graph edge, also called a digraph. A directed graph having no multiple edges or loops (corresponding to a binary adjacency matrix with 0s on the diagonal) is called a simple directed graph. A complete graph in which each edge is bidirected is called a complete directed graph. A directed graph having no symmetric pair of directed edges (i.e., no bidirected edges) is called an oriented graph. A complete oriented graph (i.e., a directed graph in which each pair of nodes is joined by a single edge having a unique direction) is called a tournament.

acyclic digraph | arborescence | Cayley graph | digraph sink | digraph topology | graph | indegree | mixed graph | multigraph | network | oriented graph | outdegree | source | strongly connected digraph | tournament | undirected graph | weakly connected digraph

college level