directed graph

Noun

This text is extracted from the Wiktionary and it is available under the CC BY-SA 3.0 license | Terms and conditions | Privacy policy 0.003

Noun

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

- A

- French: graphe orienté
- Italian: grafo orientato, grafo diretto, digrafo
- Portuguese: grafo orientado, digrafo
- Russian: ориенти́рованный граф
- Spanish: grafo dirigido

This text is extracted from the Wiktionary and it is available under the CC BY-SA 3.0 license | Terms and conditions | Privacy policy 0.003