shortestpath

[shubhamnag14]

shortest path from one node to another node in an unweighted graph using breadth first search pitch the 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 in github