Shortest Path in Unweighted Graph using BFS

[CrapTheCoder]

🚀 Feature

Shortest path from one node to another node in an unweighted graph using Breadth First Search.

Have you read the Contribution Guidelines?

Yes

Pitch

Complexity of this algorithm: O(V+E) Complexity of Dijkstra algorithm: O(V^2) when unoptimized, or O(V + E log V) when optimized using Priority Queue.

This algorithm is faster than the popular Dijkstra Algorithm, and is also far simpler, as it only uses a Breadth First Search.

[CrapTheCoder]

I would like to tackle this problem using Python

[manan025]

Assigned to: @crapthecoder - Python @shubhamnag14 - C++ @ShivangiRai1310 - Java

[shubhamnag14]

Can I work in this issue using c++

[manan025]

@shubhamnag14 Sure.

[ShivangiRai1310]

Can I work on this using Java?

[manan025]

@ShivangiRai1310 Sure

[vedant-jain03]

@manan025 I want to work on this?

[manan025]

@vedant-jain03 language?

[Mudit018]

@manan025 I want to work in on this in c++

[manan025]

@Mudit018 already assigned. Sorry.