directed graph
Quick Summary
A directed graph, or digraph, is a mathematical concept used in graph theory. It consists of a set of points, called vertices, and a set of directed edges that connect pairs of vertices. The direction of an edge is from one vertex to another, indicated by an ordered pair. For example, an edge from vertex x to vertex y is denoted as (x, y). Both (x, y) and (y, x) can exist as separate edges in a directed graph.1
Graph theory itself is a branch of mathematics concerned with networks of points connected by lines. It has applications in various fields, including computer science and operations research. The term "graph" in this context does not refer to data charts but to these sets of vertices and edges.2
Ask Britannica AI about this topic
Britannica doesn't have a full article on this topic, so we've curated a list of our relevant coverage.
graph theory…what is known as a directed graph, or digraph.
Read More…what is known as a directed graph, or digraph.
Read More
combinatoricsDirected graphsA directed graph G consists of a non-empty set of elements V(G), called vertices, and a subset E(G) of ordered pairs of distinct elements of V(G). Elements (x, y) of E(G) may be called edges, the direction of the edge being from x…
Read MoreA directed graph G consists of a non-empty set of elements V(G), called vertices, and a subset E(G) of ordered pairs of distinct elements of V(G). Elements (x, y) of E(G) may be called edges, the direction of the edge being from x…
Read More