0
3
0
1 | 1 |
SET(COIN_ROOT_DIR "" CACHE PATH "COIN root directory") |
2 | 2 |
|
3 | 3 |
FIND_PATH(COIN_INCLUDE_DIR coin/CoinUtilsConfig.h |
4 | 4 |
HINTS ${COIN_ROOT_DIR}/include |
5 | 5 |
) |
6 | 6 |
FIND_LIBRARY(COIN_CBC_LIBRARY |
7 | 7 |
NAMES Cbc libCbc |
8 |
HINTS ${COIN_ROOT_DIR}/lib/coin |
|
8 | 9 |
HINTS ${COIN_ROOT_DIR}/lib |
9 | 10 |
) |
10 | 11 |
FIND_LIBRARY(COIN_CBC_SOLVER_LIBRARY |
11 | 12 |
NAMES CbcSolver libCbcSolver |
13 |
HINTS ${COIN_ROOT_DIR}/lib/coin |
|
12 | 14 |
HINTS ${COIN_ROOT_DIR}/lib |
13 | 15 |
) |
14 | 16 |
FIND_LIBRARY(COIN_CGL_LIBRARY |
15 | 17 |
NAMES Cgl libCgl |
18 |
HINTS ${COIN_ROOT_DIR}/lib/coin |
|
16 | 19 |
HINTS ${COIN_ROOT_DIR}/lib |
17 | 20 |
) |
18 | 21 |
FIND_LIBRARY(COIN_CLP_LIBRARY |
19 | 22 |
NAMES Clp libClp |
23 |
HINTS ${COIN_ROOT_DIR}/lib/coin |
|
20 | 24 |
HINTS ${COIN_ROOT_DIR}/lib |
21 | 25 |
) |
22 | 26 |
FIND_LIBRARY(COIN_COIN_UTILS_LIBRARY |
23 | 27 |
NAMES CoinUtils libCoinUtils |
28 |
HINTS ${COIN_ROOT_DIR}/lib/coin |
|
24 | 29 |
HINTS ${COIN_ROOT_DIR}/lib |
25 | 30 |
) |
26 | 31 |
FIND_LIBRARY(COIN_OSI_LIBRARY |
27 | 32 |
NAMES Osi libOsi |
33 |
HINTS ${COIN_ROOT_DIR}/lib/coin |
|
28 | 34 |
HINTS ${COIN_ROOT_DIR}/lib |
29 | 35 |
) |
30 | 36 |
FIND_LIBRARY(COIN_OSI_CBC_LIBRARY |
31 | 37 |
NAMES OsiCbc libOsiCbc |
38 |
HINTS ${COIN_ROOT_DIR}/lib/coin |
|
32 | 39 |
HINTS ${COIN_ROOT_DIR}/lib |
33 | 40 |
) |
34 | 41 |
FIND_LIBRARY(COIN_OSI_CLP_LIBRARY |
35 | 42 |
NAMES OsiClp libOsiClp |
43 |
HINTS ${COIN_ROOT_DIR}/lib/coin |
|
36 | 44 |
HINTS ${COIN_ROOT_DIR}/lib |
37 | 45 |
) |
38 | 46 |
FIND_LIBRARY(COIN_OSI_VOL_LIBRARY |
39 | 47 |
NAMES OsiVol libOsiVol |
48 |
HINTS ${COIN_ROOT_DIR}/lib/coin |
|
40 | 49 |
HINTS ${COIN_ROOT_DIR}/lib |
41 | 50 |
) |
42 | 51 |
FIND_LIBRARY(COIN_VOL_LIBRARY |
43 | 52 |
NAMES Vol libVol |
53 |
HINTS ${COIN_ROOT_DIR}/lib/coin |
|
44 | 54 |
HINTS ${COIN_ROOT_DIR}/lib |
45 | 55 |
) |
46 | 56 |
|
47 | 57 |
INCLUDE(FindPackageHandleStandardArgs) |
48 | 58 |
FIND_PACKAGE_HANDLE_STANDARD_ARGS(COIN DEFAULT_MSG |
49 | 59 |
COIN_INCLUDE_DIR |
50 | 60 |
COIN_CBC_LIBRARY |
51 | 61 |
COIN_CBC_SOLVER_LIBRARY |
52 | 62 |
COIN_CGL_LIBRARY |
53 | 63 |
COIN_CLP_LIBRARY |
54 | 64 |
COIN_COIN_UTILS_LIBRARY |
55 | 65 |
COIN_OSI_LIBRARY |
56 | 66 |
COIN_OSI_CBC_LIBRARY |
57 | 67 |
COIN_OSI_CLP_LIBRARY |
58 |
COIN_OSI_VOL_LIBRARY |
|
59 |
COIN_VOL_LIBRARY |
|
68 |
# COIN_OSI_VOL_LIBRARY |
|
69 |
# COIN_VOL_LIBRARY |
|
60 | 70 |
) |
61 | 71 |
|
62 | 72 |
IF(COIN_FOUND) |
63 | 73 |
SET(COIN_INCLUDE_DIRS ${COIN_INCLUDE_DIR}) |
64 |
SET(COIN_LIBRARIES "${COIN_CBC_LIBRARY};${COIN_CBC_SOLVER_LIBRARY};${COIN_CGL_LIBRARY};${COIN_CLP_LIBRARY};${COIN_COIN_UTILS_LIBRARY};${COIN_OSI_LIBRARY};${COIN_OSI_CBC_LIBRARY};${COIN_OSI_CLP_LIBRARY} |
|
74 |
SET(COIN_LIBRARIES "${COIN_CBC_LIBRARY};${COIN_CBC_SOLVER_LIBRARY};${COIN_CGL_LIBRARY};${COIN_CLP_LIBRARY};${COIN_COIN_UTILS_LIBRARY};${COIN_OSI_LIBRARY};${COIN_OSI_CBC_LIBRARY};${COIN_OSI_CLP_LIBRARY}") |
|
65 | 75 |
SET(COIN_CLP_LIBRARIES "${COIN_CLP_LIBRARY};${COIN_COIN_UTILS_LIBRARY}") |
66 | 76 |
SET(COIN_CBC_LIBRARIES ${COIN_LIBRARIES}) |
67 | 77 |
ENDIF(COIN_FOUND) |
68 | 78 |
|
69 | 79 |
MARK_AS_ADVANCED( |
70 | 80 |
COIN_INCLUDE_DIR |
71 | 81 |
COIN_CBC_LIBRARY |
72 | 82 |
COIN_CBC_SOLVER_LIBRARY |
73 | 83 |
COIN_CGL_LIBRARY |
74 | 84 |
COIN_CLP_LIBRARY |
75 | 85 |
COIN_COIN_UTILS_LIBRARY |
76 | 86 |
COIN_OSI_LIBRARY |
77 | 87 |
COIN_OSI_CBC_LIBRARY |
78 | 88 |
COIN_OSI_CLP_LIBRARY |
79 | 89 |
COIN_OSI_VOL_LIBRARY |
80 | 90 |
COIN_VOL_LIBRARY |
81 | 91 |
) |
82 | 92 |
|
83 | 93 |
IF(COIN_FOUND) |
84 | 94 |
SET(LEMON_HAVE_LP TRUE) |
85 | 95 |
SET(LEMON_HAVE_MIP TRUE) |
86 | 96 |
SET(LEMON_HAVE_CLP TRUE) |
87 | 97 |
SET(LEMON_HAVE_CBC TRUE) |
88 | 98 |
ENDIF(COIN_FOUND) |
1 | 1 |
INCLUDE_DIRECTORIES( |
2 | 2 |
${PROJECT_SOURCE_DIR} |
3 | 3 |
${PROJECT_BINARY_DIR} |
4 | 4 |
) |
5 | 5 |
|
6 | 6 |
LINK_DIRECTORIES( |
7 | 7 |
${PROJECT_BINARY_DIR}/lemon |
8 | 8 |
) |
9 | 9 |
|
10 | 10 |
SET(TEST_WITH_VALGRIND "NO" CACHE STRING |
11 | 11 |
"Run the test with valgrind (YES/NO).") |
12 | 12 |
SET(VALGRIND_FLAGS "" CACHE STRING "Valgrind flags used by the tests.") |
13 | 13 |
|
14 | 14 |
SET(TESTS |
15 | 15 |
adaptors_test |
16 | 16 |
bellman_ford_test |
17 | 17 |
bfs_test |
18 | 18 |
circulation_test |
19 | 19 |
connectivity_test |
20 | 20 |
counter_test |
21 | 21 |
dfs_test |
22 | 22 |
digraph_test |
23 | 23 |
dijkstra_test |
24 | 24 |
dim_test |
25 | 25 |
edge_set_test |
26 | 26 |
error_test |
27 | 27 |
euler_test |
28 | 28 |
fractional_matching_test |
29 | 29 |
gomory_hu_test |
30 | 30 |
graph_copy_test |
31 | 31 |
graph_test |
32 | 32 |
graph_utils_test |
33 | 33 |
hao_orlin_test |
34 | 34 |
heap_test |
35 | 35 |
kruskal_test |
36 | 36 |
maps_test |
37 | 37 |
matching_test |
38 | 38 |
min_cost_arborescence_test |
39 | 39 |
min_cost_flow_test |
40 | 40 |
min_mean_cycle_test |
41 | 41 |
path_test |
42 | 42 |
planarity_test |
43 | 43 |
preflow_test |
44 | 44 |
radix_sort_test |
45 | 45 |
random_test |
46 | 46 |
suurballe_test |
47 | 47 |
time_measure_test |
48 | 48 |
unionfind_test |
49 | 49 |
) |
50 | 50 |
|
51 | 51 |
IF(LEMON_HAVE_LP) |
52 | 52 |
IF(${CMAKE_BUILD_TYPE} STREQUAL "Maintainer") |
53 | 53 |
ADD_EXECUTABLE(lp_test lp_test.cc) |
54 | 54 |
ELSE() |
55 | 55 |
ADD_EXECUTABLE(lp_test EXCLUDE_FROM_ALL lp_test.cc) |
56 | 56 |
ENDIF() |
57 | 57 |
|
58 | 58 |
SET(LP_TEST_LIBS lemon) |
59 | 59 |
|
60 | 60 |
IF(LEMON_HAVE_GLPK) |
61 | 61 |
SET(LP_TEST_LIBS ${LP_TEST_LIBS} ${GLPK_LIBRARIES}) |
62 | 62 |
ENDIF() |
63 | 63 |
IF(LEMON_HAVE_CPLEX) |
64 | 64 |
SET(LP_TEST_LIBS ${LP_TEST_LIBS} ${CPLEX_LIBRARIES}) |
65 | 65 |
ENDIF() |
66 | 66 |
IF(LEMON_HAVE_CLP) |
67 | 67 |
SET(LP_TEST_LIBS ${LP_TEST_LIBS} ${COIN_CLP_LIBRARIES}) |
68 | 68 |
ENDIF() |
69 | 69 |
|
70 | 70 |
TARGET_LINK_LIBRARIES(lp_test ${LP_TEST_LIBS}) |
71 | 71 |
ADD_TEST(lp_test lp_test) |
72 |
ADD_DEPENDENCIES(check lp_test) |
|
72 | 73 |
|
73 | 74 |
IF(WIN32 AND LEMON_HAVE_GLPK) |
74 | 75 |
GET_TARGET_PROPERTY(TARGET_LOC lp_test LOCATION) |
75 | 76 |
GET_FILENAME_COMPONENT(TARGET_PATH ${TARGET_LOC} PATH) |
76 | 77 |
ADD_CUSTOM_COMMAND(TARGET lp_test POST_BUILD |
77 | 78 |
COMMAND ${CMAKE_COMMAND} -E copy ${GLPK_BIN_DIR}/glpk.dll ${TARGET_PATH} |
78 | 79 |
COMMAND ${CMAKE_COMMAND} -E copy ${GLPK_BIN_DIR}/libltdl3.dll ${TARGET_PATH} |
79 | 80 |
COMMAND ${CMAKE_COMMAND} -E copy ${GLPK_BIN_DIR}/zlib1.dll ${TARGET_PATH} |
80 | 81 |
) |
81 | 82 |
ENDIF() |
82 | 83 |
|
83 | 84 |
IF(WIN32 AND LEMON_HAVE_CPLEX) |
84 | 85 |
GET_TARGET_PROPERTY(TARGET_LOC lp_test LOCATION) |
85 | 86 |
GET_FILENAME_COMPONENT(TARGET_PATH ${TARGET_LOC} PATH) |
86 | 87 |
ADD_CUSTOM_COMMAND(TARGET lp_test POST_BUILD |
87 | 88 |
COMMAND ${CMAKE_COMMAND} -E copy ${CPLEX_BIN_DIR}/cplex91.dll ${TARGET_PATH} |
88 | 89 |
) |
89 | 90 |
ENDIF() |
90 | 91 |
ENDIF() |
91 | 92 |
|
92 | 93 |
IF(LEMON_HAVE_MIP) |
93 | 94 |
IF(${CMAKE_BUILD_TYPE} STREQUAL "Maintainer") |
94 | 95 |
ADD_EXECUTABLE(mip_test mip_test.cc) |
95 | 96 |
ELSE() |
96 | 97 |
ADD_EXECUTABLE(mip_test EXCLUDE_FROM_ALL mip_test.cc) |
97 | 98 |
ENDIF() |
98 | 99 |
|
99 | 100 |
SET(MIP_TEST_LIBS lemon) |
100 | 101 |
|
101 | 102 |
IF(LEMON_HAVE_GLPK) |
102 | 103 |
SET(MIP_TEST_LIBS ${MIP_TEST_LIBS} ${GLPK_LIBRARIES}) |
103 | 104 |
ENDIF() |
104 | 105 |
IF(LEMON_HAVE_CPLEX) |
105 | 106 |
SET(MIP_TEST_LIBS ${MIP_TEST_LIBS} ${CPLEX_LIBRARIES}) |
106 | 107 |
ENDIF() |
107 | 108 |
IF(LEMON_HAVE_CBC) |
108 | 109 |
SET(MIP_TEST_LIBS ${MIP_TEST_LIBS} ${COIN_CBC_LIBRARIES}) |
109 | 110 |
ENDIF() |
110 | 111 |
|
111 | 112 |
TARGET_LINK_LIBRARIES(mip_test ${MIP_TEST_LIBS}) |
112 | 113 |
ADD_TEST(mip_test mip_test) |
114 |
ADD_DEPENDENCIES(check mip_test) |
|
113 | 115 |
|
114 | 116 |
IF(WIN32 AND LEMON_HAVE_GLPK) |
115 | 117 |
GET_TARGET_PROPERTY(TARGET_LOC mip_test LOCATION) |
116 | 118 |
GET_FILENAME_COMPONENT(TARGET_PATH ${TARGET_LOC} PATH) |
117 | 119 |
ADD_CUSTOM_COMMAND(TARGET mip_test POST_BUILD |
118 | 120 |
COMMAND ${CMAKE_COMMAND} -E copy ${GLPK_BIN_DIR}/glpk.dll ${TARGET_PATH} |
119 | 121 |
COMMAND ${CMAKE_COMMAND} -E copy ${GLPK_BIN_DIR}/libltdl3.dll ${TARGET_PATH} |
120 | 122 |
COMMAND ${CMAKE_COMMAND} -E copy ${GLPK_BIN_DIR}/zlib1.dll ${TARGET_PATH} |
121 | 123 |
) |
122 | 124 |
ENDIF() |
123 | 125 |
|
124 | 126 |
IF(WIN32 AND LEMON_HAVE_CPLEX) |
125 | 127 |
GET_TARGET_PROPERTY(TARGET_LOC mip_test LOCATION) |
126 | 128 |
GET_FILENAME_COMPONENT(TARGET_PATH ${TARGET_LOC} PATH) |
127 | 129 |
ADD_CUSTOM_COMMAND(TARGET mip_test POST_BUILD |
128 | 130 |
COMMAND ${CMAKE_COMMAND} -E copy ${CPLEX_BIN_DIR}/cplex91.dll ${TARGET_PATH} |
129 | 131 |
) |
130 | 132 |
ENDIF() |
131 | 133 |
ENDIF() |
132 | 134 |
|
133 | 135 |
FOREACH(TEST_NAME ${TESTS}) |
134 | 136 |
IF(${CMAKE_BUILD_TYPE} STREQUAL "Maintainer") |
135 | 137 |
ADD_EXECUTABLE(${TEST_NAME} ${TEST_NAME}.cc) |
136 | 138 |
ELSE() |
137 | 139 |
ADD_EXECUTABLE(${TEST_NAME} EXCLUDE_FROM_ALL ${TEST_NAME}.cc) |
138 | 140 |
ENDIF() |
139 | 141 |
TARGET_LINK_LIBRARIES(${TEST_NAME} lemon) |
140 | 142 |
IF(TEST_WITH_VALGRIND) |
141 | 143 |
ADD_TEST(${TEST_NAME} |
142 | 144 |
valgrind --error-exitcode=1 ${VALGRIND_FLAGS} |
143 | 145 |
${CMAKE_CURRENT_BINARY_DIR}/${TEST_NAME} ) |
144 | 146 |
ELSE() |
145 | 147 |
ADD_TEST(${TEST_NAME} ${TEST_NAME}) |
146 | 148 |
ENDIF() |
147 | 149 |
ADD_DEPENDENCIES(check ${TEST_NAME}) |
148 | 150 |
ENDFOREACH() |
... | ... |
@@ -179,98 +179,132 @@ |
179 | 179 |
checkConcept<Heap<Prio, ItemIntMap>, IntHeap>(); |
180 | 180 |
heapSortTest<IntHeap>(); |
181 | 181 |
heapIncreaseTest<IntHeap>(); |
182 | 182 |
|
183 | 183 |
typedef BinHeap<Prio, IntNodeMap > NodeHeap; |
184 | 184 |
checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>(); |
185 | 185 |
dijkstraHeapTest<NodeHeap>(digraph, length, source); |
186 | 186 |
} |
187 | 187 |
|
188 | 188 |
// QuadHeap |
189 | 189 |
{ |
190 | 190 |
typedef QuadHeap<Prio, ItemIntMap> IntHeap; |
191 | 191 |
checkConcept<Heap<Prio, ItemIntMap>, IntHeap>(); |
192 | 192 |
heapSortTest<IntHeap>(); |
193 | 193 |
heapIncreaseTest<IntHeap>(); |
194 | 194 |
|
195 | 195 |
typedef QuadHeap<Prio, IntNodeMap > NodeHeap; |
196 | 196 |
checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>(); |
197 | 197 |
dijkstraHeapTest<NodeHeap>(digraph, length, source); |
198 | 198 |
} |
199 | 199 |
|
200 | 200 |
// DHeap |
201 | 201 |
{ |
202 | 202 |
typedef DHeap<Prio, ItemIntMap> IntHeap; |
203 | 203 |
checkConcept<Heap<Prio, ItemIntMap>, IntHeap>(); |
204 | 204 |
heapSortTest<IntHeap>(); |
205 | 205 |
heapIncreaseTest<IntHeap>(); |
206 | 206 |
|
207 | 207 |
typedef DHeap<Prio, IntNodeMap > NodeHeap; |
208 | 208 |
checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>(); |
209 | 209 |
dijkstraHeapTest<NodeHeap>(digraph, length, source); |
210 | 210 |
} |
211 | 211 |
|
212 | 212 |
// FibHeap |
213 | 213 |
{ |
214 | 214 |
typedef FibHeap<Prio, ItemIntMap> IntHeap; |
215 | 215 |
checkConcept<Heap<Prio, ItemIntMap>, IntHeap>(); |
216 | 216 |
heapSortTest<IntHeap>(); |
217 | 217 |
heapIncreaseTest<IntHeap>(); |
218 | 218 |
|
219 | 219 |
typedef FibHeap<Prio, IntNodeMap > NodeHeap; |
220 | 220 |
checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>(); |
221 | 221 |
dijkstraHeapTest<NodeHeap>(digraph, length, source); |
222 | 222 |
} |
223 | 223 |
|
224 | 224 |
// PairingHeap |
225 | 225 |
{ |
226 | 226 |
typedef PairingHeap<Prio, ItemIntMap> IntHeap; |
227 | 227 |
checkConcept<Heap<Prio, ItemIntMap>, IntHeap>(); |
228 | 228 |
heapSortTest<IntHeap>(); |
229 | 229 |
heapIncreaseTest<IntHeap>(); |
230 | 230 |
|
231 | 231 |
typedef PairingHeap<Prio, IntNodeMap > NodeHeap; |
232 | 232 |
checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>(); |
233 | 233 |
dijkstraHeapTest<NodeHeap>(digraph, length, source); |
234 | 234 |
} |
235 | 235 |
|
236 | 236 |
// RadixHeap |
237 | 237 |
{ |
238 | 238 |
typedef RadixHeap<ItemIntMap> IntHeap; |
239 | 239 |
checkConcept<Heap<Prio, ItemIntMap>, IntHeap>(); |
240 | 240 |
heapSortTest<IntHeap>(); |
241 | 241 |
heapIncreaseTest<IntHeap>(); |
242 | 242 |
|
243 | 243 |
typedef RadixHeap<IntNodeMap > NodeHeap; |
244 | 244 |
checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>(); |
245 | 245 |
dijkstraHeapTest<NodeHeap>(digraph, length, source); |
246 | 246 |
} |
247 | 247 |
|
248 | 248 |
// BinomialHeap |
249 | 249 |
{ |
250 | 250 |
typedef BinomialHeap<Prio, ItemIntMap> IntHeap; |
251 | 251 |
checkConcept<Heap<Prio, ItemIntMap>, IntHeap>(); |
252 | 252 |
heapSortTest<IntHeap>(); |
253 | 253 |
heapIncreaseTest<IntHeap>(); |
254 | 254 |
|
255 | 255 |
typedef BinomialHeap<Prio, IntNodeMap > NodeHeap; |
256 | 256 |
checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>(); |
257 | 257 |
dijkstraHeapTest<NodeHeap>(digraph, length, source); |
258 | 258 |
} |
259 | 259 |
|
260 | 260 |
// BucketHeap, SimpleBucketHeap |
261 | 261 |
{ |
262 | 262 |
typedef BucketHeap<ItemIntMap> IntHeap; |
263 | 263 |
checkConcept<Heap<Prio, ItemIntMap>, IntHeap>(); |
264 | 264 |
heapSortTest<IntHeap>(); |
265 | 265 |
heapIncreaseTest<IntHeap>(); |
266 | 266 |
|
267 | 267 |
typedef BucketHeap<IntNodeMap > NodeHeap; |
268 | 268 |
checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>(); |
269 | 269 |
dijkstraHeapTest<NodeHeap>(digraph, length, source); |
270 | 270 |
|
271 | 271 |
typedef SimpleBucketHeap<ItemIntMap> SimpleIntHeap; |
272 | 272 |
heapSortTest<SimpleIntHeap>(); |
273 | 273 |
} |
274 | 274 |
|
275 |
{ |
|
276 |
typedef FibHeap<Prio, ItemIntMap> IntHeap; |
|
277 |
checkConcept<Heap<Prio, ItemIntMap>, IntHeap>(); |
|
278 |
heapSortTest<IntHeap>(); |
|
279 |
heapIncreaseTest<IntHeap>(); |
|
280 |
|
|
281 |
typedef FibHeap<Prio, IntNodeMap > NodeHeap; |
|
282 |
checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>(); |
|
283 |
dijkstraHeapTest<NodeHeap>(digraph, length, source); |
|
284 |
} |
|
285 |
|
|
286 |
{ |
|
287 |
typedef RadixHeap<ItemIntMap> IntHeap; |
|
288 |
checkConcept<Heap<Prio, ItemIntMap>, IntHeap>(); |
|
289 |
heapSortTest<IntHeap>(); |
|
290 |
heapIncreaseTest<IntHeap>(); |
|
291 |
|
|
292 |
typedef RadixHeap<IntNodeMap > NodeHeap; |
|
293 |
checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>(); |
|
294 |
dijkstraHeapTest<NodeHeap>(digraph, length, source); |
|
295 |
} |
|
296 |
|
|
297 |
{ |
|
298 |
typedef BucketHeap<ItemIntMap> IntHeap; |
|
299 |
checkConcept<Heap<Prio, ItemIntMap>, IntHeap>(); |
|
300 |
heapSortTest<IntHeap>(); |
|
301 |
heapIncreaseTest<IntHeap>(); |
|
302 |
|
|
303 |
typedef BucketHeap<IntNodeMap > NodeHeap; |
|
304 |
checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>(); |
|
305 |
dijkstraHeapTest<NodeHeap>(digraph, length, source); |
|
306 |
} |
|
307 |
|
|
308 |
|
|
275 | 309 |
return 0; |
276 | 310 |
} |
0 comments (0 inline)