A directed graph formed by giving an orientation to every edge in an undirected graph, such that it has at most one of the edges or . Oriented graphs have no 2-cycles.