## DIRECTEDGRAPH

### Directed graph

In mathematics, and more specifically in graph theory, a**directed graph**is a graph, or set of nodes connected by edges, where the edges have a direction associated with them. In formal terms, a digraph is a pair <math>G=</math> of:

*The above text is a snippet from Wikipedia: Directed graph*

and as such is available under the Creative Commons Attribution/Share-Alike License.

and as such is available under the Creative Commons Attribution/Share-Alike License.

### directed graph

#### Noun

- 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

*The above text is a snippet from Wiktionary: directed graph*

and as such is available under the Creative Commons Attribution/Share-Alike License.

and as such is available under the Creative Commons Attribution/Share-Alike License.