Skip to content

Added python code for connected components #241

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.

Sign up for GitHub

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

Jump to bottom
Closed
raghuramjee7 wants to merge 1 commit into from
Closed

Added python code for connected components #241

raghuramjee7 wants to merge 1 commit into from

Conversation

@raghuramjee7
Copy link

@raghuramjee7 raghuramjee7 commented Oct 8, 2023

Description

Added the Python code for printing all the connected components in a graph.
Changes implemented -

  1. Updated README.md to update the status of the algorithm
  2. Implemented the code for connected components using Depth First Search

Code Explanation

  1. The algorithm runs a DFS on each component and prints the component.
  2. The input is an adjacency list of nodes.
  3. The input is static, there is a method signature for writing a specialised input function.
kelvins
kelvins reviewed Oct 12, 2023
View reviewed changes
Copy link
Owner

@kelvins kelvins left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Thanks @raghuramjee7! Could you please fix the linter (CI)?
README.md
</a>
</td>
<td> <!-- Python -->
<a href="./CONTRIBUTING.md">
Copy link
Owner

@kelvins kelvins Oct 12, 2023

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

The file link is missing here, could you please add?
@raghuramjee7 raghuramjee7 closed this by deleting the head repository Nov 15, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

2 participants

@raghuramjee7 @kelvins