Breadth First Search is one of the most versatile graph traversal algorithms out there. A lot of problems can be molded into graph-based problems and in such scenarios, traversal algorithms like BFS and DFS come in very handy. BFS cannot be used for finding the shortest paths in a weighted graph. That is why we have algorithms like Dijkstra's. But what if I told you it can? Under certain constraints, BFS can be the fastest algorithm for finding out the shortest paths in a weighted graph. Read on to find out how in this beautifully written article on BFS and shortest paths in a weighted graph. The real life graph network of flights is considered to make the article more engrossing and fun to read. https://medium.freecodecamp.org/exploring-the-applications-and-limits-of-breadth-first-search-to-the-shortest-paths-in-a-weighted-1e7b28b3307