I am working on a project in which I am creating an adjacency matrix of cities and need to find and print out up to 3 of the shortest paths based on time or cost between two cities. I am struggling in figuring out what the easiest way to do this is. I am supposed to use a priority queue to store the shortest paths. If anyone has an ideas or can show me how to do this that would be great. Thanks.