2
4
2
... | ... |
@@ -86,14 +86,14 @@ |
86 | 86 |
lemon/list_graph.h \ |
87 | 87 |
lemon/lp.h \ |
88 | 88 |
lemon/lp_base.h \ |
89 | 89 |
lemon/lp_skeleton.h \ |
90 | 90 |
lemon/list_graph.h \ |
91 | 91 |
lemon/maps.h \ |
92 |
lemon/matching.h \ |
|
92 | 93 |
lemon/math.h \ |
93 |
lemon/max_matching.h \ |
|
94 | 94 |
lemon/min_cost_arborescence.h \ |
95 | 95 |
lemon/nauty_reader.h \ |
96 | 96 |
lemon/path.h \ |
97 | 97 |
lemon/preflow.h \ |
98 | 98 |
lemon/radix_sort.h \ |
99 | 99 |
lemon/random.h \ |
... | ... |
@@ -26,13 +26,13 @@ |
26 | 26 |
graph_test |
27 | 27 |
graph_utils_test |
28 | 28 |
hao_orlin_test |
29 | 29 |
heap_test |
30 | 30 |
kruskal_test |
31 | 31 |
maps_test |
32 |
|
|
32 |
matching_test |
|
33 | 33 |
min_cost_arborescence_test |
34 | 34 |
path_test |
35 | 35 |
preflow_test |
36 | 36 |
radix_sort_test |
37 | 37 |
random_test |
38 | 38 |
suurballe_test |
... | ... |
@@ -22,13 +22,13 @@ |
22 | 22 |
test/graph_test \ |
23 | 23 |
test/graph_utils_test \ |
24 | 24 |
test/hao_orlin_test \ |
25 | 25 |
test/heap_test \ |
26 | 26 |
test/kruskal_test \ |
27 | 27 |
test/maps_test \ |
28 |
test/ |
|
28 |
test/matching_test \ |
|
29 | 29 |
test/min_cost_arborescence_test \ |
30 | 30 |
test/path_test \ |
31 | 31 |
test/preflow_test \ |
32 | 32 |
test/radix_sort_test \ |
33 | 33 |
test/random_test \ |
34 | 34 |
test/suurballe_test \ |
... | ... |
@@ -67,13 +67,13 @@ |
67 | 67 |
test_heap_test_SOURCES = test/heap_test.cc |
68 | 68 |
test_kruskal_test_SOURCES = test/kruskal_test.cc |
69 | 69 |
test_hao_orlin_test_SOURCES = test/hao_orlin_test.cc |
70 | 70 |
test_lp_test_SOURCES = test/lp_test.cc |
71 | 71 |
test_maps_test_SOURCES = test/maps_test.cc |
72 | 72 |
test_mip_test_SOURCES = test/mip_test.cc |
73 |
|
|
73 |
test_matching_test_SOURCES = test/matching_test.cc |
|
74 | 74 |
test_min_cost_arborescence_test_SOURCES = test/min_cost_arborescence_test.cc |
75 | 75 |
test_path_test_SOURCES = test/path_test.cc |
76 | 76 |
test_preflow_test_SOURCES = test/preflow_test.cc |
77 | 77 |
test_radix_sort_test_SOURCES = test/radix_sort_test.cc |
78 | 78 |
test_suurballe_test_SOURCES = test/suurballe_test.cc |
79 | 79 |
test_random_test_SOURCES = test/random_test.cc |
... | ... |
@@ -19,13 +19,13 @@ |
19 | 19 |
#include <iostream> |
20 | 20 |
#include <sstream> |
21 | 21 |
#include <vector> |
22 | 22 |
#include <queue> |
23 | 23 |
#include <cstdlib> |
24 | 24 |
|
25 |
#include <lemon/ |
|
25 |
#include <lemon/matching.h> |
|
26 | 26 |
#include <lemon/smart_graph.h> |
27 | 27 |
#include <lemon/concepts/graph.h> |
28 | 28 |
#include <lemon/concepts/maps.h> |
29 | 29 |
#include <lemon/lgf_reader.h> |
30 | 30 |
#include <lemon/math.h> |
31 | 31 |
... | ... |
@@ -39,13 +39,13 @@ |
39 | 39 |
|
40 | 40 |
#include <lemon/arg_parser.h> |
41 | 41 |
#include <lemon/error.h> |
42 | 42 |
|
43 | 43 |
#include <lemon/dijkstra.h> |
44 | 44 |
#include <lemon/preflow.h> |
45 |
#include <lemon/ |
|
45 |
#include <lemon/matching.h> |
|
46 | 46 |
|
47 | 47 |
using namespace lemon; |
48 | 48 |
typedef SmartDigraph Digraph; |
49 | 49 |
DIGRAPH_TYPEDEFS(Digraph); |
50 | 50 |
typedef SmartGraph Graph; |
51 | 51 |
|
0 comments (0 inline)