A directed graph, or digraph, is a type of graph where the edges have a direction. This means that each edge connects two vertices (or nodes) in a specific way, indicating a one-way relationship. For example, if there is an edge from vertex A to vertex B, it shows that A points to B, but not necessarily the other way around. Directed graphs are commonly used in various fields, such as computer science and social network analysis. They can represent relationships like webpage links, where one page links to another, or task scheduling, where certain tasks must be completed before others can begin.