Feature Request: Implement C++ Backend for Breadth-First Search (BFS)

[arvinder004]

The project currently has a Python implementation of the Breadth-First Search (BFS) algorithm. To improve performance and efficiency, especially when dealing with large graphs, a C++ backend implementation is needed. C++ offers advantages in terms of memory management and execution speed, which are crucial for graph traversal algorithms. Adding a C++ backend for BFS will allow users to leverage these performance benefits.

Example of the problem:

While the Python implementation works correctly, it can become slow and memory-intensive when applied to:

• Large graphs with millions of nodes and edges.
• Real-time graph analysis where speed is critical.
• A C++ implementation would address these performance bottlenecks.