title: BFS for shortest path in weighted graph
body: <p>I was revising single source shortest path algorithms and it was mentioned that BFS would not work properly .
  but , shouldnt it work properly if the algorithm was dijkstra like ( using dist[node] instead of visit[node])? , I also had problems determining the complexity of this algorithm</p>