cyclicity

Graph cyclicity and Directed Acyclic Graph (DAG) analysis.

Values

is_acyclic

pub fn is_acyclic(graph: model.Graph(n, e)) -> Bool

Checks if the graph is a Directed Acyclic Graph (DAG) or has no cycles if undirected.

For directed graphs, a cycle exists if there is a path from a node back to itself. For undirected graphs, a cycle exists if there is a path of length >= 3 from a node back to itself, or a self-loop.

Time Complexity: O(V + E)

is_cyclic

</>

pub fn is_cyclic(graph: model.Graph(n, e)) -> Bool

Checks if the graph contains at least one cycle.

Logical opposite of is_acyclic.

Time Complexity: O(V + E)