OpenGenus/cosmos

Add code for detecting cycle in undirected graph

Open

#420 opened on Oct 4, 2017

View on GitHubContributor guide
 (7 comments) (1 reaction) (0 assignees)C++ (3,724 forks)batch import
Hacktoberfestadd codenew algorithm

Repository metrics

Stars
 (13,462 stars)
PR merge metrics
 (No merged PRs in 30d)

Description

I'm working for this in C++ :)

Contributor guide

Research direction
Implement a cycle detection algorithm for undirected graph using DFS or Union Find. Write a C++ function that accepts an adjacency list and returns true if a cycle exists.
Tech stack
cpp
Domain
databackend
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
3
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
Half day
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Active
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
C++Graph algorithms
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
70