Implement Bidirectional BFS algorithm

[darkatwi]

This class implements the Bidirectional Breadth-First Search (BFS) algorithm to determine if a path exists between two nodes in an unweighted graph. It explores the graph from both the start and goal nodes simultaneously, improving efficiency for large graphs.

• [x] I have read CONTRIBUTING.md.
• [x] This pull request is all my own work -- I have not plagiarized it.
• [x] All filenames are in PascalCase.
• [x] All functions and variable names follow Java naming conventions.
• [x] All new algorithms have a URL in their comments that points to Wikipedia or other similar explanations.
• [x] All new code is formatted with clang-format -i --style=file path/to/your/file.java