Oriented graph
Материал из WikiGrapp
Oriented graph --- ориентированный граф.
A digraph [math]\displaystyle{ G }[/math] is called an oriented graph if [math]\displaystyle{ G }[/math] does not contain a cycle of two arcs. A complete oriented graph is called a tournament.
