Definitions | directed graph |
| noun (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.
Translations: Supplemental Details:Sponsor an extended definition for directed graph for as little as $10 per month. Click here to contact us.
| |
|