Definition Directed Graph A graph G=(V,E) is called directed if every edge is an ordered pair of vertices, i.e., E⊆V×V.