Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Problem
-There was no existing implementation of the Breadth First Search (BFS) algorithm in the repository.
Solution
-Added a C program that implements the BFS algorithm using an adjacency matrix and queue.
The program allows users to input vertices, edges, and a starting node to perform traversal.
This implementation helps contributors understand graph traversal, queue operations, and adjacency matrix representation.
Addresses #<issue number #324>
Changes proposed in this Pull Request :
1...Implemented queue-based logic for level order traversal of graphs.
Ensured clean input/output handling for easier execution and understanding.
Fixes #324