#Shortest Path

Find the cheapest flight route from a source to a destination within at most K stops using Graph, BFS, and shortest-path concepts.

Write a function that prints all shortest paths between a given source and destination node in an undirected graph. Use a suitable algorithm to ensure correct shortest path determination.