Directed Graph

In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed edges, often called arcs. (edges having a Direction/arrow); see also knowledge graph