... | ... |
@@ -32,107 +32,106 @@ |
32 | 32 |
$(CPLEX_LIBS) \ |
33 | 33 |
$(SOPLEX_LIBS) \ |
34 | 34 |
$(CLP_LIBS) \ |
35 | 35 |
$(CBC_LIBS) |
36 | 36 |
|
37 | 37 |
if HAVE_GLPK |
38 | 38 |
lemon_libemon_la_SOURCES += lemon/glpk.cc |
39 | 39 |
endif |
40 | 40 |
|
41 | 41 |
if HAVE_CPLEX |
42 | 42 |
lemon_libemon_la_SOURCES += lemon/cplex.cc |
43 | 43 |
endif |
44 | 44 |
|
45 | 45 |
if HAVE_SOPLEX |
46 | 46 |
lemon_libemon_la_SOURCES += lemon/soplex.cc |
47 | 47 |
endif |
48 | 48 |
|
49 | 49 |
if HAVE_CLP |
50 | 50 |
lemon_libemon_la_SOURCES += lemon/clp.cc |
51 | 51 |
endif |
52 | 52 |
|
53 | 53 |
if HAVE_CBC |
54 | 54 |
lemon_libemon_la_SOURCES += lemon/cbc.cc |
55 | 55 |
endif |
56 | 56 |
|
57 | 57 |
lemon_HEADERS += \ |
58 | 58 |
lemon/adaptors.h \ |
59 | 59 |
lemon/arg_parser.h \ |
60 | 60 |
lemon/assert.h \ |
61 | 61 |
lemon/bfs.h \ |
62 | 62 |
lemon/bin_heap.h \ |
63 | 63 |
lemon/bucket_heap.h \ |
64 | 64 |
lemon/cbc.h \ |
65 | 65 |
lemon/circulation.h \ |
66 | 66 |
lemon/clp.h \ |
67 | 67 |
lemon/color.h \ |
68 | 68 |
lemon/concept_check.h \ |
69 | 69 |
lemon/connectivity.h \ |
70 | 70 |
lemon/counter.h \ |
71 | 71 |
lemon/core.h \ |
72 | 72 |
lemon/cplex.h \ |
73 | 73 |
lemon/dfs.h \ |
74 | 74 |
lemon/dijkstra.h \ |
75 | 75 |
lemon/dim2.h \ |
76 | 76 |
lemon/dimacs.h \ |
77 | 77 |
lemon/edge_set.h \ |
78 | 78 |
lemon/elevator.h \ |
79 | 79 |
lemon/error.h \ |
80 | 80 |
lemon/euler.h \ |
81 | 81 |
lemon/fib_heap.h \ |
82 | 82 |
lemon/full_graph.h \ |
83 | 83 |
lemon/glpk.h \ |
84 | 84 |
lemon/gomory_hu.h \ |
85 | 85 |
lemon/graph_to_eps.h \ |
86 | 86 |
lemon/grid_graph.h \ |
87 | 87 |
lemon/hypercube_graph.h \ |
88 | 88 |
lemon/kruskal.h \ |
89 | 89 |
lemon/hao_orlin.h \ |
90 | 90 |
lemon/lgf_reader.h \ |
91 | 91 |
lemon/lgf_writer.h \ |
92 | 92 |
lemon/list_graph.h \ |
93 | 93 |
lemon/lp.h \ |
94 | 94 |
lemon/lp_base.h \ |
95 | 95 |
lemon/lp_skeleton.h \ |
96 |
lemon/list_graph.h \ |
|
97 | 96 |
lemon/maps.h \ |
98 | 97 |
lemon/matching.h \ |
99 | 98 |
lemon/math.h \ |
100 | 99 |
lemon/min_cost_arborescence.h \ |
101 | 100 |
lemon/nauty_reader.h \ |
102 | 101 |
lemon/network_simplex.h \ |
103 | 102 |
lemon/path.h \ |
104 | 103 |
lemon/preflow.h \ |
105 | 104 |
lemon/radix_heap.h \ |
106 | 105 |
lemon/radix_sort.h \ |
107 | 106 |
lemon/random.h \ |
108 | 107 |
lemon/smart_graph.h \ |
109 | 108 |
lemon/soplex.h \ |
110 | 109 |
lemon/suurballe.h \ |
111 | 110 |
lemon/time_measure.h \ |
112 | 111 |
lemon/tolerance.h \ |
113 | 112 |
lemon/unionfind.h \ |
114 | 113 |
lemon/bits/windows.h |
115 | 114 |
|
116 | 115 |
bits_HEADERS += \ |
117 | 116 |
lemon/bits/alteration_notifier.h \ |
118 | 117 |
lemon/bits/array_map.h \ |
119 | 118 |
lemon/bits/bezier.h \ |
120 | 119 |
lemon/bits/default_map.h \ |
121 | 120 |
lemon/bits/edge_set_extender.h \ |
122 | 121 |
lemon/bits/enable_if.h \ |
123 | 122 |
lemon/bits/graph_adaptor_extender.h \ |
124 | 123 |
lemon/bits/graph_extender.h \ |
125 | 124 |
lemon/bits/map_extender.h \ |
126 | 125 |
lemon/bits/path_dump.h \ |
127 | 126 |
lemon/bits/solver_bits.h \ |
128 | 127 |
lemon/bits/traits.h \ |
129 | 128 |
lemon/bits/variant.h \ |
130 | 129 |
lemon/bits/vector_map.h |
131 | 130 |
|
132 | 131 |
concept_HEADERS += \ |
133 | 132 |
lemon/concepts/digraph.h \ |
134 | 133 |
lemon/concepts/graph.h \ |
135 | 134 |
lemon/concepts/graph_components.h \ |
136 | 135 |
lemon/concepts/heap.h \ |
137 | 136 |
lemon/concepts/maps.h \ |
138 | 137 |
lemon/concepts/path.h |
0 comments (0 inline)