[go: up one dir, main page]
Jump to content

directed graph

From Wiktionary, the free dictionary

English

[edit]
A simple directed graph.

Noun

[edit]

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
    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

[edit]

Further reading

[edit]
Retrieved from "https://en.wiktionary.org/w/index.php?title=directed_graph&oldid=82695215"