Skip to content

[UPDATE ALGORITHM] Complete Breadth-First Search (BFS) implementation #4751

Open

Description

@Ela-El-maker

Description:

The repository already has a dedicated BFS directory and documentation, but the implementation file is currently empty:

  • Graph Algorithms/Breadth-First Search (BFS)/Program.c (0 bytes)

The README.md in the same folder explains BFS and expected logic, but there is no runnable C implementation.
I want to update this by adding a complete BFS program (queue + visited array) for graph traversal from a source node.

Checklist:

  • Contributor in GSSoC-ext
  • Want to work on it

Affected Algorithm:

Breadth-First Search (BFS)
Directory: Graph Algorithms/Breadth-First Search (BFS)/

Additional Information:

Planned update includes:

  • Full Program.c implementation for BFS traversal
  • Sample graph in main() to demonstrate output
  • Keep README and code behavior aligned

Please assign this issue to me.

Activity

  1. github-actions commented on Apr 19, 2026

    @github-actions

    👋 Thank you for raising an issue! We appreciate your effort in helping us improve. Our team will review it shortly. Stay tuned!

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

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Type

    No type

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions