|
|
Definition of Directed graph
1. Noun. (graph theory) A graph in which the edges are ordered pairs, so that, if the edge (a, b) is in the graph, the edge (b, a) need not be in the graph and is distinct from (a, b) if it is. ¹
¹ Source: wiktionary.com
Lexicographical Neighbors of Directed Graph
Other Resources:
