pywhy_graphs.algorithms.has_adc#
- pywhy_graphs.algorithms.has_adc(G)[source]#
Check if a graph has an almost directed cycle (adc).
An almost directed cycle is a is a directed cycle containing one bidirected edge. For example,
A -> B -> C <-> Ais an adc.- Parameters:
- GGraph
The graph.
- Returns:
- adc_presentbool
A boolean indicating whether an almost directed cycle is present or not.