Given a Graph Find shortest path from source to the destination vertex . But if two or more path has same length then print the lexicographically smaller one

• PREPREQUISITE : BFS

• EXPLANATION LINK :

Classical BFS Problem . We need to sort Adjacent vertices of every node in ascending order . Other than this the whole process is just like BFS .