Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Articulation Points #1

Open
DeltaCube23 opened this issue Sep 30, 2021 · 2 comments
Open

Articulation Points #1

DeltaCube23 opened this issue Sep 30, 2021 · 2 comments
Labels
Algorithms Problem statements which deal with algorithms Hacktoberfest intermediate

Comments

@DeltaCube23
Copy link

DeltaCube23 commented Sep 30, 2021

Description

Take an undirected graph with N vertices and M edges as the input. Find all the articulation points of the graph.

Details

  • Technical Specifications: C/C++/Python/Java/Go
  • Type of issue: Single
  • Time Limit: 1 day after being assigned the issue

Issue requirements / progress

  • The solution should be efficient in terms of time and space complexity

Resources

https://xlinux.nist.gov/dads/HTML/cutvertex.html

Directory Structure

Create a Folder "1_Articulation_Points" under the "Algorithms" directory and within it add your file with the same name.

Note

  1. Please claim the issue first by commenting here before starting to work on it.
  2. Once you are done with the task and have created a Pull Request, please tag @DeltaCube23 to request a review.
@muditsinghal muditsinghal added Hacktoberfest Algorithms Problem statements which deal with algorithms intermediate labels Sep 30, 2021
@Laaaaksh
Copy link

Laaaaksh commented Oct 6, 2021

Hey, I would like to take up this issue! @DeltaCube23

@DeltaCube23
Copy link
Author

Okay go ahead. @muditsinghal can you assign this to @Laaaaksh

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Algorithms Problem statements which deal with algorithms Hacktoberfest intermediate
Projects
None yet
Development

No branches or pull requests

3 participants