Skip to content

Added DFS "Islands" problem solution in CPP #206

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
Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Added DFS "Islands" problem solution in CPP #206

wants to merge 1 commit into from

Conversation

paritoshM9
Copy link
Contributor

@paritoshM9 paritoshM9 commented Oct 23, 2019 •
edited
Loading

Description

Added DFS Islands problem along with solution in CPP

Mohitkumar6122
Mohitkumar6122 reviewed Jun 15, 2021
View reviewed changes
Graph_Algorithms/src/Depth_First_Traversal/Graphs.md

void dfs(int curr, int* visited, int** adj_matrix, int n){
visited[curr] = 1;
for(int i = 0; i<n ; i++){
Copy link
Member

Choose a reason for hiding this comment

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

indexing should be done as :
for(int row = 0; row <= adj_matrix.size(); ++row)
with more meaningful variable names.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers
1 more reviewer

@Mohitkumar6122 Mohitkumar6122 Mohitkumar6122 left review comments

Reviewers whose approvals may not affect merge requirements

At least 1 approving review is required to merge this pull request.

Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
2 participants
@paritoshM9 @Mohitkumar6122