[Idea]: Cycle Detection in Undirected Graph

[shuvojitss]

Idea Title

Cycle Detection in Undirected Graph

Idea Description

NAME

New Algorithm : Cycle Detection in Undirected Graph Given an undirected graph with V vertices and E edges, check whether it contains any cycle or not.

Input:

The number of Vertex and edges

Output:

• Cycle exist
• Cycle doesnot exist.

Potential Benefits

• [X] Improves user experience
• [X] Enhances learning
• [X] Adds a new feature
• [X] Improves code quality
• [X] Other

Implementation Suggestions (Optional)

No response

[shuvojitss]

@ajay-dhangar Please assign the issue.