Open carlschroedl opened 6 years ago
Low-Priority performance optimization: Cycle detection in RankedPairsGraph is not efficient. Write an algorithm that simply detects whether a given vertex is in a cycle. Consider contributing the algorithm and tests to the graph library.
RankedPairsGraph
Low-Priority performance optimization: Cycle detection in
RankedPairsGraphis not efficient. Write an algorithm that simply detects whether a given vertex is in a cycle. Consider contributing the algorithm and tests to the graph library.