A directed graph (or digraph) is a set of vertices and a collection of directed edges that each connects an ordered pair of vertices.

digraph G {
  1->2
  2->3
  1->3
  2->2
}