A graph with directed edges is called a directed graph or diagraph.
Fig: A 3 node directed graph
A directed walk (or Walk) in a directed graph is a sequence of vertices v0, v1, v2………vk and egdes v0 -> v1, v1 -> v2, ……. vk-1 -> vk.
Directed Acyclic Graph (DAG)
A directed graph is called a Directed Acyclic Graph (DAG) if it does not contain any directed cycles.