Feedback Arc Set problem is particularly difficult in k-edge-connected graphs for large k, where each edge falls in many different cycles. The decision version of the problem, which is NP-complete, asks whether all cycles can be broken by removing at most k edges; this was one of Richard M. Karp's 21 NP-complete problems, shown by reducing from the vertex cover problem.

Presented the most used algorithms (5-th is custom).

At first use graphGenerator.py to generate graph with degree distribution.