directed graph

短语

[计] 有向图

词形变化

directed graphs 复数 directed graphs

释义与例句

n.
  1. 1.

    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.