# directed graph 中文

EN中向图

- 名词 (Noun)PLdirected graphsSUF-graph
- (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

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

## Definition of __directed graph__ in English Dictionary

- 词类阶层 (Part-of-Speech Hierarchy)
- 名词
- 可数名词

- 可数名词

- 名词

资料来源: 维基词典