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 ...