equal
deleted
inserted
replaced
66 // Max flow between s and t in the graph of tight edges. |
66 // Max flow between s and t in the graph of tight edges. |
67 Preflow<SubGW, int, ConstMap<Edge, int>, Graph::EdgeMap<int> > |
67 Preflow<SubGW, int, ConstMap<Edge, int>, Graph::EdgeMap<int> > |
68 preflow(gw, s, t, const_1_map, flow); |
68 preflow(gw, s, t, const_1_map, flow); |
69 preflow.run(); |
69 preflow.run(); |
70 |
70 |
71 cout << "maximum number of edge-disjoint shortest path: " |
71 cout << "maximum number of edge-disjoint shortest paths: " |
72 << preflow.flowValue() << endl; |
72 << preflow.flowValue() << endl; |
73 cout << "edges of the maximum number of edge-disjoint shortest s-t paths: " |
73 cout << "edges of the maximum number of edge-disjoint shortest s-t paths: " |
74 << endl; |
74 << endl; |
75 for(EdgeIt e(g); e!=INVALID; ++e) |
75 for(EdgeIt e(g); e!=INVALID; ++e) |
76 if (flow[e]) |
76 if (flow[e]) |