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
19 #include <lemon/counter.h>
21 ///\file \brief Test cases for time_measure.h
23 ///\todo To be extended
28 static lemon::Counter count("Fibonacci steps: ");
31 else if(f==1) return 1;
32 else return fibonacci(f-1)+fibonacci(f-2);
40 typedef lemon::Counter MyCounter;
41 MyCounter c("Main counter: ");
44 MyCounter::SubCounter d(c,"Subcounter: ");
47 MyCounter::SubCounter::SubCounter e(d,"SubSubCounter: ");
53 typedef lemon::NoCounter MyCounter;
54 MyCounter c("Main counter: ");
57 MyCounter::SubCounter d(c,"Subcounter: ");
60 MyCounter::SubCounter::SubCounter e(d,"SubSubCounter: ");