laboratory task, but nowhere can I find information about such an algorithm.

  • Probably not DAG , but a trivial OAG? Well, then just ask Vika what “Acyclic orientation” is. - Akina
  • "Any graph has an acyclic orientation. One of the ways to create acyclic orientations is to order the vertices and then orient each edge from an earlier vertex in the list to a later one" - from wiki. How exactly should you arrange the vertices? how to orient the edges? Please explain on the example of such a graph: vertices 1,2,3,4. ribs 1-2 2-3 3-1 3-4 4-1 - Zlofey
  • vertices 1,2,3,4. edges 1-2 2-3 3-1 3-4 4-1 Well, Russians write in white: with the subsequent orientation of each edge from an earlier top in the list to a later one . If we consider later, for example, a vertex with a larger number, then we need to “flip” those edges where the vertex number of the beginning is greater than the vertex number of the end. This edge is number 3 (since 3 is greater than 1, we convert it to 1-> 3) and edge number 5 (because 4 is greater than 1, we convert it to 1-> 4). - Akina

0