directed graph

English dictionary entry

Meanings

noun
  1. 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.

Word forms

directed graph directed graphs

Synonyms

Antonyms

This entry uses open data from Wiktionary (CC BY-SA/GFDL). Word forms are used for search and are not indexed as separate pages.