directed graph definition

  • noun:
    • A graph when the sides are ordered pairs, in order that, in the event that advantage (a, b) is within the graph, the side (b, a) do not need to maintain the graph and it is distinct from (a, b) in case it is.

Related Sources

  • Synonym for "directed graph"
  • Antonym for "directed graph"
29 votes

How would you define directed graph?

All the definitions on AZdictionary were written by people just like you. Now's your chance to add your own!