Expand description
Feedback arc set (ALGO-CY-002).
A feedback arc set (FAS) is a set of edges whose removal makes the graph acyclic. For undirected graphs the minimum FAS equals the set of edges not in any spanning tree. For directed graphs this is NP-hard; we implement the Eades-Lin-Smyth (1993) heuristic which is guaranteed to find a FAS smaller than |E|/2 - |V|/6 in O(|E|).
Counterpart of igraph_feedback_arc_set.
Enums§
- FasAlgorithm
- Algorithm choice for computing the feedback arc set.
Functions§
- feedback_
arc_ set - Compute a feedback arc set — a set of edge IDs whose removal makes the graph acyclic.