Definition Directed Graph A graph is called directed if every edge is an ordered pair of vertices, i.e.,