Orientation (graph theory)

In graph theory, an orientation of an undirected graph is an assignment of a direction to each edge, turning the initial graph into a directed graph. == Oriented graphs == A directed graph is called an oriented graph if none of its pairs of vertices is linked by two mutually symmetric edges.