directed graph
Jump to navigation
Jump to search
English
[edit]![](http://178.128.105.246/cars-http-upload.wikimedia.org/wikipedia/commons/thumb/a/a2/Directed.svg/220px-Directed.svg.png)
Noun
[edit]directed graph (plural directed graphs)
- (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]graph in which the edges are ordered pairs
|
Further reading
[edit]directed graph on Wikipedia.Wikipedia