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

direct tide
direct transfusion
direct transmission
direct trust
direct verb
direct verbs
direct vision
direct vision spectroscope
direct zoonosis
directable
directed
directed acyclic word graph
directed acyclic word graphs
directed edge
directed edges
directed graph (current term)
directed graphs
directed molecular evolution
directed path
directed verdict
directedly
directedness
directednesses
directer
directest
directeur sportif
directing
direction
direction finder
directional

Other Resources:

Search for Directed graph on Dictionary.com!Search for Directed graph on Thesaurus.com!Search for Directed graph on Google!Search for Directed graph on Wikipedia!

Search