A directed graph, or digraph G consists of a finite nonempty set of vertices V, and a finite set of edges E, where an edge is an ordered pair of vertices in V.

• 有向图，或图克组成的有限非空子集的顶点V和有限的一套边英，那里的优势是下令对顶点在五顶点也称为节点。