template<class K, class E> void binarySearchTree<K,E>::erase(const K& theKey) {// Delete the pair, if any, whose key equals theKey. // search for node with key theKey binaryTree...

void shortestPaths(int sourceVertex,T* distanceFromSource, int* predecessor) { //predecessor[i]保存从源定点到达顶点i的路径中前面的那个顶点 // Find shortest paths from sourceVertex. // Return sho...