图任务

 

在单源最短路径和所有对最短路径的问题中，每边(u, v)都有一权值w(u,v)，如果图含有循环，且循环中所有边的权值之和小于0，那么能够到达这个循环的点，没有最短路劲，因为最短路径陷入了循环。如何检测负循环的存在很简单，可以结合在Bellman-Ford算法中，在最后对所有边(u,v)，进行判断，如果d(v) >= d(u) + w(u, v)，则图存在负循环。如果负循环存在，怎么找出其中最小的负循环？

连通图，强连通图

最小生成树，

单元最短路径，

all-pair最短路径，

最大流网络，

二分图匹配，带权值的二分图完美匹配。

 

 

 

// AN OO GRAPH // vertex u, with satelate data, u // edge e(u, v), related to two vertex // adjacent list ?? adjacent matrix ?? #include <string> #include <vector> #include <stack> #include <queue> #include <list> #include <iostream> #include "../heap/heap.h" // Vertex is user-dependent, show() method required class Vertex { std::string name; public: friend ostream &operator<<(ostream &os, const Vertex &v) { os << v.name; return os; }; Vertex(const std::string &name_ = "defaultname") : name(name_) { } Vertex(const char *name_ = "defaultname") : name(name_) { } void show() { std::cout << name ; } }; template <typename Vertex> class Graph { std::vector<Vertex> vertices; std::vector<std::vector<double> > edges; // alogrithm required: std::vector<int> color; std::vector<int> f; enum {white, gray, black}; public: Graph(const std::vector<Vertex> &v, const std::vector<std::vector<double> > &e) : vertices(v), edges(e) { color = std::vector<int>(vertices.size()); f = std::vector<int>(vertices.size()); std::cout << "v/t "; for (int i = 0; i != vertices.size(); i++) std::cout << i+1; std::cout << std::endl << "/t "; for (int i = 0; i != vertices.size(); i++) std::cout << '-'; std::cout << std::endl; for (int i = 0; i != vertices.size(); i++) { vertices[i].show(); std::cout << "/t|"; for (int j = 0; j != vertices.size(); j++) std::cout << edges[i][j]; std::cout << std::endl; } } friend class HeapElem; int get_nvertices() { return vertices.size(); } double get_edge(int i, int j) { return edges[i][j]; } Vertex &get_vertex(int i) { return *(vertices.begin()+i); } bool adjacent_to(const Vertex &u, const Vertex &v) { return true; } bool adjacent_to(int i, int j) { return edges[i][j] > 0; } //double get_edge(const Vertex &u, const Vertex &v) { return e[u][v]; } public: void dfs(); // depth-first search void bfs(); // breadth-first search void scc(); // strong-connected components void mst(); // minimum spanning tree void mst_kruskal(); void mst_prim(); void bellman_ford(); void dijkstra(); private: void transpose(); // void disjoint_sets(); // sssp(); // apsp(); }; template <typename Vertex> class Directed_Graph : public Graph<Vertex> { }; template <typename Vertex> class Undirected_Graph : public Graph<Vertex> { // G = G + G' };

 

 

 

template <typename Vertex> void Graph<Vertex>::transpose() { for (int i = 0; i != vertices.size(); i++) for (int j = i + 1; j != vertices.size(); j++) swap(edges[i][j], edges[j][i]); } template <typename Vertex> void Graph<Vertex>::dfs() { // vector::iterator iter = vertices.begin(); std::stack<int> vs; int d = 0; for (int i = 0; i != vertices.size(); i++) { color[i] = white; f[i] = 0; } for (int i = 0; i != vertices.size(); i++) { if (color[i] == black) continue; std::cout << "dfs tree " << i << ": "; vs.push(i); color[i] = gray; while (!vs.empty()) { int t = vs.top(); if (color[t] == black) { //std::cout << "pop " << t + 1 << std::endl; vs.pop(); f[t] = d++; continue; } else if (color[t] == gray) { color[t] = black; vertices[t].show(); std::cout << " "; d++; } for (int j = 0; j != vertices.size(); j++) if (adjacent_to(t, j) && color[j] == white) { //std::cout << "push " << j + 1 << std::endl; vs.push(j); color[j] = gray; } } std::cout << std::endl; } } template <typename Vertex> void Graph<Vertex>::bfs() { std::queue<int> vq; for (int i = 0; i != vertices.size(); i++) color[i] = 0; for (int i = 0; i != vertices.size(); i++) { if (color[i] == black) continue; std::cout << "bst tree " << i << ": "; vq.push(i); while (!vq.empty()) { int front = vq.front(); vq.pop(); if (!color[front]) { color[front] = black; vertices[front].show(); std::cout << " "; } for (int i = 0; i != vertices.size(); i++) if (adjacent_to(front, i) && color[i] == white) vq.push(i); } std::cout << std::endl; } } template <typename Vertex> void Graph<Vertex>::scc() { std::vector<int> scc_order(vertices.size()); std::stack<int> vs; int d = 0; dfs(); transpose(); // sort vertices by finished time for (int i = 0; i != vertices.size(); i++) { int max_f = 0; for (int j = 0; j != vertices.size(); j++) if (f[max_f] < f[j]) max_f = j; scc_order[i] = max_f; f[max_f] = 0; } for (int i = 0; i != vertices.size(); i++) { color[i] = white; f[i] = 0; } for (int i = 0; i != vertices.size(); i++) { if (color[scc_order[i]] == black) continue; std::cout << "scc " << scc_order[i] << ": "; vs.push(scc_order[i]); color[scc_order[i]] = gray; while (!vs.empty()) { int t = vs.top(); if (color[t] == black) { vs.pop(); f[t] = d++; continue; } else if (color[t] == gray) { color[t] = black; vertices[t].show(); std::cout << " "; d++; } for (int j = 0; j != vertices.size(); j++) if (adjacent_to(t, j) && color[j] == white) { vs.push(j); color[j] = gray; } } std::cout << std::endl; } transpose(); // trans back } template <typename Vertex> void Graph<Vertex>::mst_kruskal() { std::vector<int> v_from; std::vector<int> v_to; std::vector<double> weight_list; std::vector<int> joint_sets(vertices.size()); for (int i = 0; i != vertices.size(); i++) joint_sets[i] = i; // serialize edges for (int i = 0; i != vertices.size(); i++) { for (int j = 0; j != vertices.size(); j++) { if (edges[i][j] != 0) { v_from.push_back(i); v_to.push_back(j); weight_list.push_back(edges[i][j]); } } } // sortting for (int i = 0; i != weight_list.size(); i++) { double min = weight_list[i]; int m = 0; for (int j = i + 1; j != weight_list.size(); j++) if (min > weight_list[j]) { min = weight_list[j]; m = j; } if (m != 0) { int t1, t2; double tw; t1 = v_from[i]; t2 = v_to[i]; v_from[i] = v_from[m]; v_to[i] = v_to[m]; v_from[m] = t1; v_to[m] = t2; tw = weight_list[i]; weight_list[i] = weight_list[m]; weight_list[m] = tw; } } std::cout << "safe edges selected by Kruskal:" << std::endl; for (int i = 0; i != weight_list.size(); i++) { if (joint_sets[v_from[i]] != joint_sets[v_to[i]]) { std::cout << "("; vertices[v_from[i]].show(); std::cout << ", "; vertices[v_to[i]].show(); std::cout << ")" << std::endl; int set = joint_sets[v_to[i]]; for (int j = 0; j != vertices.size(); j++) { if (joint_sets[j] == set) { //std::cout << "modify sets[" << j+1 << "]"; //std::cout << " to " << joint_sets[v_from[i]] + 1 << std::endl; joint_sets[j] = joint_sets[v_from[i]]; } } } } } class HeapElem { public: friend ostream &operator<<(ostream &os, const HeapElem &po) { os << "(" << po.key << ", " << po.heap_index << " vertex index: "; os << po.vertex_index + 1 << ", " << "from: "; os << po.parent<< ")"; return os; } double key; int heap_index; int vertex_index; int parent; static const double maximum_key = 9.99e+300; static const double minimum_key = 0.0; static const int null = 0; }; template <typename Vertex> void Graph<Vertex>::mst_prim() { //root = vertices.rand(); //for all vertices, key = oo, //Key root = 0; //heap insert root std::vector<HeapElem> prim_objects(vertices.size()); MinHeap<HeapElem, double> prim_heap; for (int i = 0; i != vertices.size(); i++) { prim_objects[i].key = 2147483647; prim_objects[i].vertex_index = i; prim_heap.insert(prim_objects[i]); } prim_objects[0].parent = -1; // root double just_for_double_ref = 0.0; prim_heap.decrease_key(prim_objects[0], just_for_double_ref); std::cout << "Prim edges:" << std::endl; while (!prim_heap.empty()) { //std::cout << prim_heap << std::endl; const HeapElem &min_obj = prim_heap.extract_min(); //std::cout << "extracted object: " << min_obj << std::endl; std::cout << "("; if (min_obj.parent != -1) std::cout << vertices[min_obj.parent]; else std::cout << "root"; std::cout << ", "; std::cout << vertices[min_obj.vertex_index] << ")" << std::endl; for (int i = 0; i != vertices.size(); i++) { if (adjacent_to(min_obj.vertex_index, i) && edges[min_obj.vertex_index][i] < prim_objects[i].key) { prim_objects[i].parent = min_obj.vertex_index; prim_heap.decrease_key(prim_objects[i], edges[min_obj.vertex_index][i]); } else if ( adjacent_to(i, min_obj.vertex_index) && edges[i][min_obj.vertex_index] < prim_objects[i].key) { prim_objects[i].parent = min_obj.vertex_index; prim_heap.decrease_key(prim_objects[i], edges[i][min_obj.vertex_index]); } } } } // O(VE) = O(V^3) for matrix representation template <typename Vertex> void Graph<Vertex>::bellman_ford() { int parent[vertices.size()]; double d[vertices.size()]; int trace[vertices.size()], ti; for (int v = 0; v != vertices.size(); v++) { parent[v] = -1; // nil d[v] = 9.9e+300; } d[0] = 0; // the single source for (int v = 0; v != vertices.size(); v++) { for (int i = 0; i != vertices.size(); i++) { for (int j = 0; j != vertices.size(); j++) { if (edges[i][j] != 0 && d[i] + edges[i][j] < d[j]) { d[j] = d[i] + edges[i][j]; parent[j] = i; } } } } std::cout << "path dump: " << std::endl; for (int i = 1; i != vertices.size(); i++) { ti = 0; for (int t = i; parent[t] != -1; trace[ti++] = t, t = parent[t]); if (ti == 0) { std::cout << "no path from " << vertices[0] << "to "; std::cout << vertices[i] << std::endl; continue; } std::cout << "shortest path from " << vertices[0] << " to "; std::cout << vertices[i] << " is " << d[i] << ", trace : " << vertices[0]; while (ti-- != 0) std::cout << "->" << vertices[trace[ti]]; std::cout << std::endl; } } // for matrix representation, running time depend on djst_heap implementation, // running time = V * extract_min + E * decrease_key, // bin-heap: O((V + E)lgV) = O(V^2lgV), // vector-heap: O(V^2 + E) = O(V^2) template <typename Vertex> void Graph<Vertex>::dijkstra() { int trace[vertices.size()], ti; std::vector<HeapElem> djst_objs(vertices.size()); MinHeap<HeapElem, double> djst_heap; // heap[i].key represents d[i] for (int i = 0; i != vertices.size(); i++) { djst_objs[i].key = HeapElem::maximum_key; djst_objs[i].vertex_index = i; djst_objs[i].parent = -1; djst_heap.insert(djst_objs[i]); } djst_objs[0].key = 0.0; djst_heap.decrease_key(djst_objs[0], 0.0); while (!djst_heap.empty()) { std::cout << djst_heap << std::endl; int v = djst_heap.extract_min().vertex_index; std::cout << "extract " << vertices[v] << std::endl; std::cout << djst_heap << std::endl; for (int i = 0; i != vertices.size(); i++) { if (adjacent_to(v, i) && djst_objs[v].key + edges[v][i] < djst_objs[i].key) { djst_objs[i].parent = v; djst_heap.decrease_key(djst_objs[i], djst_objs[v].key + edges[v][i]); std::cout << "relaxing " << vertices[i] << "to " << djst_objs[i].key << std::endl; } } } std::cout << "path dump: " << std::endl; for (int i = 1; i != vertices.size(); i++) { ti = 0; for (int t = i; djst_objs[t].parent != -1; trace[ti++] = t, t = djst_objs[t].parent); if (ti == 0) { std::cout << "no path from " << vertices[0] << "to "; std::cout << vertices[i] << std::endl; continue; } std::cout << "shortest path from " << vertices[0] << " to "; std::cout << vertices[i] << " is " << djst_objs[i].key << ", trace : " << vertices[0]; while (ti-- != 0) std::cout << "->" << vertices[trace[ti]]; std::cout << std::endl; } }