I am trying to find shortest path from a src node to dest node in an weighted graph using bfs.
but the code passed only 14% test cases on codechef. I figured out may be it was because of the order in which edges were added. because sample test has edges in increasing order. so I even sorted my adjancy list. still same answer. what should I do?