directed graph

Hello, you have come here looking for the meaning of the word directed graph. In DICTIOUS you will not only get to know all the dictionary meanings for the word directed graph, but we will also tell you about its etymology, its characteristics and you will know how to say directed graph in singular and plural. Everything you need to know about the word directed graph you have here. The definition of the word directed graph will help you to be more precise and correct when speaking or writing your texts. Knowing the definition ofdirected graph, as well as those of other words, enriches your vocabulary and provides you with more and better linguistic resources.

English

A simple directed graph.

Noun

directed graph (plural directed graphs)

  1. (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.
    Synonym: digraph
    Antonym: undirected graph
    A directed graph (A, R) is a set of vertices A together with an incidence relation R: if aRb then there is an edge going from A to B.

Translations

Further reading