r440:88ed40ad0d4f
Thu, 01 Jan 2009 00:00:00
[Not Reviewed]
0 comments (0 inline)
!
!
!
1
1
2
2
1
1
21
21
1
1
1
1
1
1
1
1
1
1
1
1
1
1
12
12
| ... | ... |
@@ -4,3 +4,3 @@ |
| 4 | 4 |
* |
| 5 |
* Copyright (C) 2003- |
|
| 5 |
* Copyright (C) 2003-2009 |
|
| 6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
| ... | ... |
@@ -87,3 +87,3 @@ |
| 87 | 87 |
title("Sample .eps figure").
|
| 88 |
copyright("(C) 2003-
|
|
| 88 |
copyright("(C) 2003-2009 LEMON Project").
|
|
| 89 | 89 |
run(); |
| ... | ... |
@@ -94,3 +94,3 @@ |
| 94 | 94 |
title("Sample .eps figure").
|
| 95 |
copyright("(C) 2003-
|
|
| 95 |
copyright("(C) 2003-2009 LEMON Project").
|
|
| 96 | 96 |
absoluteNodeSizes().absoluteArcWidths(). |
| ... | ... |
@@ -107,3 +107,3 @@ |
| 107 | 107 |
title("Sample .eps figure (with arrowheads)").
|
| 108 |
copyright("(C) 2003-
|
|
| 108 |
copyright("(C) 2003-2009 LEMON Project").
|
|
| 109 | 109 |
absoluteNodeSizes().absoluteArcWidths(). |
| ... | ... |
@@ -134,3 +134,3 @@ |
| 134 | 134 |
title("Sample .eps figure (parallel arcs)").
|
| 135 |
copyright("(C) 2003-
|
|
| 135 |
copyright("(C) 2003-2009 LEMON Project").
|
|
| 136 | 136 |
absoluteNodeSizes().absoluteArcWidths(). |
| ... | ... |
@@ -149,3 +149,3 @@ |
| 149 | 149 |
title("Sample .eps figure (parallel arcs and arrowheads)").
|
| 150 |
copyright("(C) 2003-
|
|
| 150 |
copyright("(C) 2003-2009 LEMON Project").
|
|
| 151 | 151 |
absoluteNodeSizes().absoluteArcWidths(). |
| ... | ... |
@@ -165,3 +165,3 @@ |
| 165 | 165 |
title("Sample .eps figure (fits to A4)").
|
| 166 |
copyright("(C) 2003-
|
|
| 166 |
copyright("(C) 2003-2009 LEMON Project").
|
|
| 167 | 167 |
scaleToA4(). |
| ... | ... |
@@ -195,3 +195,3 @@ |
| 195 | 195 |
title("Sample .eps figure (Palette demo)").
|
| 196 |
copyright("(C) 2003-
|
|
| 196 |
copyright("(C) 2003-2009 LEMON Project").
|
|
| 197 | 197 |
coords(hcoords). |
| ... | ... |
@@ -4,3 +4,3 @@ |
| 4 | 4 |
* |
| 5 |
* Copyright (C) 2003- |
|
| 5 |
* Copyright (C) 2003-2009 |
|
| 6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
| ... | ... |
@@ -73,3 +73,3 @@ |
| 73 | 73 |
|
| 74 |
This directory contains some auxiliary classes for implementing graphs, |
|
| 74 |
This directory contains some auxiliary classes for implementing graphs, |
|
| 75 | 75 |
maps and some other classes. |
| ... | ... |
@@ -9,6 +9,6 @@ |
| 9 | 9 |
lemon_libemon_la_SOURCES = \ |
| 10 |
lemon/arg_parser.cc \ |
|
| 11 |
lemon/base.cc \ |
|
| 12 |
lemon/color.cc \ |
|
| 13 |
lemon/random.cc |
|
| 10 |
lemon/arg_parser.cc \ |
|
| 11 |
lemon/base.cc \ |
|
| 12 |
lemon/color.cc \ |
|
| 13 |
lemon/random.cc |
|
| 14 | 14 |
|
| ... | ... |
@@ -19,15 +19,15 @@ |
| 19 | 19 |
lemon/adaptors.h \ |
| 20 |
|
|
| 20 |
lemon/arg_parser.h \ |
|
| 21 | 21 |
lemon/assert.h \ |
| 22 |
lemon/bfs.h \ |
|
| 23 |
lemon/bin_heap.h \ |
|
| 24 |
lemon/circulation.h \ |
|
| 25 |
lemon/color.h \ |
|
| 22 |
lemon/bfs.h \ |
|
| 23 |
lemon/bin_heap.h \ |
|
| 24 |
lemon/circulation.h \ |
|
| 25 |
lemon/color.h \ |
|
| 26 | 26 |
lemon/concept_check.h \ |
| 27 |
|
|
| 27 |
lemon/counter.h \ |
|
| 28 | 28 |
lemon/core.h \ |
| 29 |
lemon/dfs.h \ |
|
| 30 |
lemon/dijkstra.h \ |
|
| 31 |
lemon/dim2.h \ |
|
| 32 |
lemon/dimacs.h \ |
|
| 29 |
lemon/dfs.h \ |
|
| 30 |
lemon/dijkstra.h \ |
|
| 31 |
lemon/dim2.h \ |
|
| 32 |
lemon/dimacs.h \ |
|
| 33 | 33 |
lemon/elevator.h \ |
| ... | ... |
@@ -35,4 +35,4 @@ |
| 35 | 35 |
lemon/full_graph.h \ |
| 36 |
lemon/graph_to_eps.h \ |
|
| 37 |
lemon/grid_graph.h \ |
|
| 36 |
lemon/graph_to_eps.h \ |
|
| 37 |
lemon/grid_graph.h \ |
|
| 38 | 38 |
lemon/hypercube_graph.h \ |
| ... | ... |
@@ -49,7 +49,7 @@ |
| 49 | 49 |
lemon/preflow.h \ |
| 50 |
|
|
| 50 |
lemon/random.h \ |
|
| 51 | 51 |
lemon/smart_graph.h \ |
| 52 | 52 |
lemon/suurballe.h \ |
| 53 |
lemon/time_measure.h \ |
|
| 54 |
lemon/tolerance.h \ |
|
| 53 |
lemon/time_measure.h \ |
|
| 54 |
lemon/tolerance.h \ |
|
| 55 | 55 |
lemon/unionfind.h |
| ... | ... |
@@ -60,5 +60,5 @@ |
| 60 | 60 |
lemon/bits/base_extender.h \ |
| 61 |
|
|
| 61 |
lemon/bits/bezier.h \ |
|
| 62 | 62 |
lemon/bits/default_map.h \ |
| 63 |
|
|
| 63 |
lemon/bits/enable_if.h \ |
|
| 64 | 64 |
lemon/bits/graph_adaptor_extender.h \ |
| ... | ... |
@@ -4,3 +4,3 @@ |
| 4 | 4 |
* |
| 5 |
* Copyright (C) 2003- |
|
| 5 |
* Copyright (C) 2003-2009 |
|
| 6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
| ... | ... |
@@ -240,3 +240,3 @@ |
| 240 | 240 |
_sets.push_front(std::list<int>()); |
| 241 |
|
|
| 241 |
|
|
| 242 | 242 |
queue[qlast++] = t; |
| ... | ... |
@@ -540,3 +540,3 @@ |
| 540 | 540 |
_sets.push_front(std::list<int>()); |
| 541 |
|
|
| 541 |
|
|
| 542 | 542 |
queue[qlast++] = t; |
| 1 |
/* -*- C++ -*- |
|
| 1 |
/* -*- mode: C++; indent-tabs-mode: nil; -*- |
|
| 2 | 2 |
* |
| 3 |
* This file is a part of LEMON, a generic C++ optimization library |
|
| 3 |
* This file is a part of LEMON, a generic C++ optimization library. |
|
| 4 | 4 |
* |
| 5 |
* Copyright (C) 2003- |
|
| 5 |
* Copyright (C) 2003-2009 |
|
| 6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
| ... | ... |
@@ -78,3 +78,3 @@ |
| 78 | 78 |
private: |
| 79 |
|
|
| 79 |
|
|
| 80 | 80 |
/// \brief Special implementation of the Dijkstra algorithm |
| ... | ... |
@@ -108,3 +108,3 @@ |
| 108 | 108 |
std::vector<Node> _proc_nodes; |
| 109 |
|
|
| 109 |
|
|
| 110 | 110 |
Node _s; |
| ... | ... |
@@ -202,3 +202,3 @@ |
| 202 | 202 |
const LengthMap &_length; |
| 203 |
|
|
| 203 |
|
|
| 204 | 204 |
// Arc map of the current flow |
| ... | ... |
@@ -270,3 +270,3 @@ |
| 270 | 270 |
/// |
| 271 |
/// The potentials provide the dual solution of the underlying |
|
| 271 |
/// The potentials provide the dual solution of the underlying |
|
| 272 | 272 |
/// minimum cost flow problem. |
| ... | ... |
@@ -332,3 +332,3 @@ |
| 332 | 332 |
|
| 333 |
_dijkstra = new ResidualDijkstra( _graph, *_flow, _length, |
|
| 333 |
_dijkstra = new ResidualDijkstra( _graph, *_flow, _length, |
|
| 334 | 334 |
*_potential, _pred, |
| ... | ... |
@@ -372,3 +372,3 @@ |
| 372 | 372 |
} |
| 373 |
|
|
| 373 |
|
|
| 374 | 374 |
/// \brief Compute the paths from the flow. |
| ... | ... |
@@ -4,3 +4,3 @@ |
| 4 | 4 |
* |
| 5 |
* Copyright (C) 2003- |
|
| 5 |
* Copyright (C) 2003-2009 |
|
| 6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
| ... | ... |
@@ -1191,3 +1191,3 @@ |
| 1191 | 1191 |
pushRight(jd, ld); |
| 1192 |
if (less(ld, nodes[jd].left) || |
|
| 1192 |
if (less(ld, nodes[jd].left) || |
|
| 1193 | 1193 |
nodes[ld].item == nodes[pd].item) {
|
| ... | ... |
@@ -5,3 +5,3 @@ |
| 5 | 5 |
test/graph_test.h \ |
| 6 |
|
|
| 6 |
test/test_tools.h |
|
| 7 | 7 |
|
| ... | ... |
@@ -9,4 +9,4 @@ |
| 9 | 9 |
test/bfs_test \ |
| 10 |
test/circulation_test \ |
|
| 11 |
test/counter_test \ |
|
| 10 |
test/circulation_test \ |
|
| 11 |
test/counter_test \ |
|
| 12 | 12 |
test/dfs_test \ |
| ... | ... |
@@ -14,3 +14,3 @@ |
| 14 | 14 |
test/dijkstra_test \ |
| 15 |
|
|
| 15 |
test/dim_test \ |
|
| 16 | 16 |
test/error_test \ |
| ... | ... |
@@ -23,11 +23,11 @@ |
| 23 | 23 |
test/kruskal_test \ |
| 24 |
|
|
| 24 |
test/maps_test \ |
|
| 25 | 25 |
test/max_matching_test \ |
| 26 |
test/path_test \ |
|
| 27 |
test/preflow_test \ |
|
| 28 |
test/random_test \ |
|
| 29 |
test/suurballe_test \ |
|
| 30 |
test/test_tools_fail \ |
|
| 31 |
test/test_tools_pass \ |
|
| 32 |
|
|
| 26 |
test/path_test \ |
|
| 27 |
test/preflow_test \ |
|
| 28 |
test/random_test \ |
|
| 29 |
test/suurballe_test \ |
|
| 30 |
test/test_tools_fail \ |
|
| 31 |
test/test_tools_pass \ |
|
| 32 |
test/time_measure_test \ |
|
| 33 | 33 |
test/unionfind_test |
| ... | ... |
@@ -4,3 +4,3 @@ |
| 4 | 4 |
* |
| 5 |
* Copyright (C) 2003- |
|
| 5 |
* Copyright (C) 2003-2009 |
|
| 6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
| ... | ... |
@@ -105,3 +105,3 @@ |
| 105 | 105 |
arc_filter[a1] = arc_filter[a2] = arc_filter[a3] = true; |
| 106 |
|
|
| 106 |
|
|
| 107 | 107 |
checkGraphNodeList(adaptor, 3); |
| ... | ... |
@@ -198,3 +198,3 @@ |
| 198 | 198 |
node_filter[n1] = node_filter[n2] = node_filter[n3] = true; |
| 199 |
|
|
| 199 |
|
|
| 200 | 200 |
checkGraphNodeList(adaptor, 3); |
| ... | ... |
@@ -270,3 +270,3 @@ |
| 270 | 270 |
arc_filter[a1] = arc_filter[a2] = arc_filter[a3] = true; |
| 271 |
|
|
| 271 |
|
|
| 272 | 272 |
checkGraphNodeList(adaptor, 3); |
| ... | ... |
@@ -579,3 +579,3 @@ |
| 579 | 579 |
edge_filter[e1] = edge_filter[e2] = edge_filter[e3] = edge_filter[e4] = true; |
| 580 |
|
|
| 580 |
|
|
| 581 | 581 |
checkGraphNodeList(adaptor, 4); |
| ... | ... |
@@ -710,3 +710,3 @@ |
| 710 | 710 |
node_filter[n1] = node_filter[n2] = node_filter[n3] = node_filter[n4] = true; |
| 711 |
|
|
| 711 |
|
|
| 712 | 712 |
checkGraphNodeList(adaptor, 4); |
| ... | ... |
@@ -809,3 +809,3 @@ |
| 809 | 809 |
edge_filter[e1] = edge_filter[e2] = edge_filter[e3] = edge_filter[e4] = true; |
| 810 |
|
|
| 810 |
|
|
| 811 | 811 |
checkGraphNodeList(adaptor, 4); |
| 1 |
/* -*- C++ -*- |
|
| 1 |
/* -*- mode: C++; indent-tabs-mode: nil; -*- |
|
| 2 | 2 |
* |
| 3 |
* This file is a part of LEMON, a generic C++ optimization library |
|
| 3 |
* This file is a part of LEMON, a generic C++ optimization library. |
|
| 4 | 4 |
* |
| 5 |
* Copyright (C) 2003- |
|
| 5 |
* Copyright (C) 2003-2009 |
|
| 6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
| ... | ... |
@@ -74,3 +74,3 @@ |
| 74 | 74 |
template <typename Digraph, typename FlowMap> |
| 75 |
bool checkFlow( const Digraph& gr, const FlowMap& flow, |
|
| 75 |
bool checkFlow( const Digraph& gr, const FlowMap& flow, |
|
| 76 | 76 |
typename Digraph::Node s, typename Digraph::Node t, |
| ... | ... |
@@ -97,3 +97,3 @@ |
| 97 | 97 |
// Check the optimalitiy of the flow |
| 98 |
template < typename Digraph, typename CostMap, |
|
| 98 |
template < typename Digraph, typename CostMap, |
|
| 99 | 99 |
typename FlowMap, typename PotentialMap > |
| ... | ... |
@@ -146,3 +146,3 @@ |
| 146 | 146 |
run(); |
| 147 |
|
|
| 147 |
|
|
| 148 | 148 |
// Find 2 paths |
| ... | ... |
@@ -154,3 +154,3 @@ |
| 154 | 154 |
check(suurballe.totalLength() == 510, "The flow is not optimal"); |
| 155 |
check(checkOptimality(digraph, length, suurballe.flowMap(), |
|
| 155 |
check(checkOptimality(digraph, length, suurballe.flowMap(), |
|
| 156 | 156 |
suurballe.potentialMap()), |
| ... | ... |
@@ -169,3 +169,3 @@ |
| 169 | 169 |
check(suurballe.totalLength() == 1040, "The flow is not optimal"); |
| 170 |
check(checkOptimality(digraph, length, suurballe.flowMap(), |
|
| 170 |
check(checkOptimality(digraph, length, suurballe.flowMap(), |
|
| 171 | 171 |
suurballe.potentialMap()), |
| ... | ... |
@@ -184,3 +184,3 @@ |
| 184 | 184 |
check(suurballe.totalLength() == 1040, "The flow is not optimal"); |
| 185 |
check(checkOptimality(digraph, length, suurballe.flowMap(), |
|
| 185 |
check(checkOptimality(digraph, length, suurballe.flowMap(), |
|
| 186 | 186 |
suurballe.potentialMap()), |
0 comments (0 inline)