directed graph

English

A simple directed graph.

Noun

directed graph (plural directed graphs)

  2. (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
    Coordinate term: oriented 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

This page is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.