Definitions from Wiktionary (directed graph)

▸ 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.




▸ Words similar to directed graph
▸ Usage examples for directed graph

▸ Idioms related to directed graph
▸ Wikipedia articles (New!)
▸ Words that often appear near directed graph
▸ Rhymes of directed graph

▸ Invented words related to directed graph