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

Flood-fill #1760

Closed
wants to merge 2 commits into from
Closed

Flood-fill #1760

wants to merge 2 commits into from

Conversation

its-akshay
Copy link

πŸ› οΈ Issue (Number)

Issue no #1720

πŸ‘¨β€πŸ’» Changes proposed

This pull request proposes enhancements to the flood fill algorithm implementation in {{C,C++,Java,Python}} The flood fill algorithm is an essential technique used in various applications, and this contribution aims to enhance the existing implementation in multiple languages.

βœ”οΈ Check List (Check all the applicable boxes)

  • My code follows the code style of this project.
  • This PR does not contain plagiarized content.
  • The title of my pull request is a short description of the requested changes.

@github-actions
Copy link

Thanks for your contribution we will soon check your PR @its-akshay :)

@Kumar-laxmi Kumar-laxmi added Graphs Algorithm for graphs C Program in C C++ Programs in C++ Python Programs in Python Java Programs in Java Under Review The PR is under review SSOC23 PR under Social Summer of Code labels Jul 23, 2023
@its-akshay
Copy link
Author

@Arun9739 @Kumar-laxmi Please review this PR and merge it.

@Arun9739 Arun9739 added Ready to Merge and removed Under Review The PR is under review labels Aug 8, 2023
@its-akshay its-akshay closed this by deleting the head repository Feb 11, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
C Program in C C++ Programs in C++ Graphs Algorithm for graphs Java Programs in Java Python Programs in Python Ready to Merge SSOC23 PR under Social Summer of Code
Projects
None yet
Development

Successfully merging this pull request may close these issues.

5 participants