I need to figure out how to find the shortest path between two vertices in an adjacency matrix representation of an undirected graph. I get the impression that I'm supposed to use Dijkstra's ...

In this paper, we consider a variant of shortest path problems where, in addition to congestion related time-dependent link travel times on a given transportation network, we also have specific labels ...