Bidirectional Search [graph_algorithm]

[Aryan Kashyap]

This is a(n):

• New algorithm
• Update to an existing algorithm
• Error
• Proposal to the Repository

Details:

Bidirectional Search is Graph Search Algorithm where two graph traversals (BFS) take place at the same time and is used to find the shortest distance between a fixed start vertex and end vertex.

I've seen the java implementation over the main website but the code hasn't been updated here.

https://iq.opengenus.org/bidirectional-search/

I would like to add the Java and C++ implementation