weighted graphs true or falsethe weight of the mst depends on the starting vertex in the mst algorithmwhat is removed from the priority queue in the cable tv exampleeach edge added to the mst connects the starting vertex to an adjacent vertex an already-connected city to an unconnected city the current vertex to an adjacent vertex two cities with offices the mst algorithm "prunesan edge from the list when the edge leads to vertex that true or falsethe shortest-path problem (sppmust be carried out on directed graph dijkstra' algorithm finds the shortest path from one specified vertex to all other vertices from one specified vertex to another specified vertex from all vertices to all other vertices that can be reached along one edge from all vertices to all other vertices that can be reached along multiple edges true or falsethe rule in dijkstra' algorithm is to always put in the tree the vertex that is closest to the starting vertex in the railroad fares examplea fringe town is one to which the distance is knownbut from which no distances are known which is in the tree to which the distance is known and which is in the tree which is completely unknown the all-pairs shortest-path problem involves finding the shortest path from the starting vertex to every other vertex from every vertex to every other vertex from the starting vertex to every vertex that is one edge away from every vertex to every other vertex that is one or more edges away