Feedback
Directed graph
Meaning
Noun
●
In 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
b
e in the
graph
and is
distinct
from (a,
b
) if it is.
Sourced from
Wiktionary
Synonyms
Digraph
Antonyms
Undirected Graph
Join 10 million students and professionals writing 70% faster at QuillBot.com
Start writing better