A directed graph is a graph which has edges which can only be traversed in one direction.[refcomap, p.177] A directed graph

a bunch of nodes connected by arrows

a bunch of vertices and edges, where the edges have a direction specified

a cactus if and only if it is strongly connected and each edge is part of

a collection of nodes (vertices) together with arcs joining some of these vertices

a DataStructure containing a vertex set V and an arc set A , where each arc (or edge , or link ) is an ordered pair of vertices (or nodes , or sommets )

a graph in which all arcs have a direction associated with them - so can be interrogated as to which node they come from and which they go to

a graph in which each edge has a direction, usually represented as an arrow from a vertex v to a vertex w

a graph where each line has an arrow (direction) associated with it

a map of the network from the perspective of the router, that is, the root of the graph is the router

a set of dots (called vertices) together with a set of arrows (called edges) each of which points from one vertex to another

a structure containing two collections of elements, called nodes and arcs respectively, together with a relation ("connectivity") that places a general structure upon the nodes and arcs

A graph with one-way edges. See also directed acyclic graph (DAG).

(n.) a graph in which the edges have an orientation, denoted by arrowheads.

A graph whose edges have direction, typically represented as arrows.