void getEdges(const Graph & g, tmatrix
&adj) // pre: g is Graph with g.vertexSize() > 0 // post: adj is adjacency matrix for graph g // if there is an edge from vertex i to vertex j // in g with weight w, then adj[i][j] == w
We can use BFS to find the shortest path between nodes in an unweighted graph. How? How is Dijkstra's algorithm an improvement over your algorithm?