Implement Breadth First Search (BFS) Algorithm in Python, C, and Java

[muzhar01]

Description

This pull request implements the Breadth First Search (BFS) algorithm #57 across three programming languages: Python, C, and Java. The project aims to provide a comprehensive understanding of BFS as a fundamental graph traversal technique, showcasing its practical implementations in different programming environments. Each implementation includes an example of usage, helping users grasp how BFS operates in various contexts.

List your tech stack and any dependencies that are required for this change. This information will help us review and integrate your contributions effectively.

• Python: No external dependencies required.
• C: Standard libraries.
• Java: No external dependencies required.

Type of change

• [X] New Project
• [ ] New Feature
• [ ] Bug fix

Issue number: #

Checklist:

• [X] I have included a README.md file for my project clearly explaining its purpose, functionality, and usage instructions (applicable for new projects, not bug fixes).
• [X] My code adheres to the style guidelines outlined by this project.
• [X] I have thoroughly reviewed my code to identify and address any potential errors or inconsistencies.
• [X] I have added clear and concise comments to my code, especially in sections that might be challenging to understand at first glance.
• [X] I have reviewed and followed the project's Contributing Guidelines to ensure my contribution aligns with the project's requirements.