Query improvements in the min cost flow algorithms.
- External flow and potential maps can be used.
- New query functions: flow() and potential().
- CycleCanceling also provides dual solution (node potentials).
- Doc improvements.
3 * This file is a part of LEMON, a generic C++ optimization library
5 * Copyright (C) 2003-2008
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7 * (Egervary Research Group on Combinatorial Optimization, EGRES).
9 * Permission to use, modify and distribute this software is granted
10 * provided that this copyright notice appears in all copies. For
11 * precise terms see the accompanying LICENSE file.
13 * This software is provided "AS IS" with no warranty of any kind,
14 * express or implied, and with no claim as to its suitability for any
22 #include <lemon/concepts/graph.h>
23 #include <lemon/concepts/ugraph.h>
24 #include <lemon/smart_graph.h>
26 #include <lemon/edge_set.h>
28 #include "test_tools.h"
29 #include "graph_test.h"
33 using namespace lemon;
34 using namespace lemon::concepts;
36 typedef SmartGraph RGraph;
39 { // checking edge_sets
40 checkConcept<Graph, ListEdgeSet<RGraph> >();
41 checkConcept<UGraph, ListUEdgeSet<RGraph> >();
42 checkConcept<Graph, SmartEdgeSet<RGraph> >();
43 checkConcept<UGraph, SmartUEdgeSet<RGraph> >();
46 std::cout << __FILE__ ": All tests passed.\n";