# Detect a cycle in a Graph

### Background

> 1. If graph is a tree, there must be n - 1 edges when vertex is n.
> 2. There must be a cycle if the number of edges is greater or equal to n

### Detect a cycle with union find?

{% embed url="<https://www.geeksforgeeks.org/introduction-to-disjoint-set-data-structure-or-union-find-algorithm/>" %}

### How to check cycle?

* Count Edges
  * undirected only
* DFS
  * both possible
  * directed - white/gray/black
  * undirected - true/false
* Union Find - disjoint set
  * undirected only
  * no self loop


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://algorithm.prettylog.com/overview/2.-data-structures/graph/detect-a-cycle-in-a-graph.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.