A digraph D with p vertices and q arcs is labeled by assigning a distinct integer value g(v) from f0, 1, :::, qg to each vertex v. The vertex values, in turn, induce a value g(u, v) on each arc (u, v) where g(u, v) ¼ (g(v) À g(u)) (mod q þ 1) If the arc values are all distinct then the labeling is called a graceful labeling of digraph. In this survey article, we have collected results that we could find interesting on graceful labeling of digraphs.