in graph theory, a directed graph is a graph where the vertices are connected by directed edges called arcs.