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 benchmark/edge_lookup_test
5 noinst_HEADERS += benchmark/bench_tools.h
10 benchmark/graph-bench \
12 benchmark/swap_bipartite_bench \
14 benchmark/radix_sort-bench \
15 benchmark/swap_bipartite_bench \
16 benchmark/random_bench \
17 benchmark/edge_lookup \
22 benchmark_graph_bench_SOURCES = benchmark/graph-bench.cc
24 benchmark_hcube_SOURCES = benchmark/hcube.cc
26 benchmark_bfs_bench_SOURCES = benchmark/bfs-bench.cc
28 benchmark_radix_sort_bench_SOURCES = benchmark/radix_sort-bench.cc
30 benchmark_swap_bipartite_bench_SOURCES = benchmark/swap_bipartite_bench.cc
32 benchmark_random_bench_SOURCES = benchmark/random_bench.cc
34 benchmark_edge_lookup_SOURCES = benchmark/edge_lookup.cc
36 benchmark_min_cut_SOURCES = benchmark/min_cut.cc