Directed graphs
= Directed graphs
{wiki=Category:Directed_graphs}
A directed graph (or digraph) is a type of graph in which the edges have a specific direction. This means that each edge connects an ordered pair of vertices (or nodes), indicating a one-way relationship between them. In more formal terms, if there is a directed edge from vertex \\( A \\) to vertex \\( B \\), it is often represented as \\( A \\rightarrow B \\).