lemon/Makefile.am
author Peter Kovacs <kpeter@inf.elte.hu>
Thu, 12 Nov 2009 23:45:15 +0100
changeset 811 fe80a8145653
parent 805 d3e32a777d0b
child 814 0643a9c2c3ae
permissions -rw-r--r--
Small implementation improvements in MCF algorithms (#180)

- Handle max() as infinite value (not only infinity()).
- Better GEQ handling in CapacityScaling.
- Skip the unnecessary saturating operations in the first phase in
CapacityScaling.
- Use vector<char> instead of vector<bool> and vector<int> if it is
possible and it proved to be usually faster.
ladanyi@1
     1
EXTRA_DIST += \
ladanyi@146
     2
	lemon/lemon.pc.in \
alpar@667
     3
	lemon/CMakeLists.txt \
alpar@667
     4
	lemon/config.h.cmake
ladanyi@1
     5
ladanyi@1
     6
pkgconfig_DATA += lemon/lemon.pc
ladanyi@1
     7
ladanyi@1
     8
lib_LTLIBRARIES += lemon/libemon.la
ladanyi@1
     9
alpar@7
    10
lemon_libemon_la_SOURCES = \
alpar@440
    11
	lemon/arg_parser.cc \
alpar@440
    12
	lemon/base.cc \
alpar@440
    13
	lemon/color.cc \
deba@458
    14
	lemon/lp_base.cc \
deba@458
    15
	lemon/lp_skeleton.cc \
deba@567
    16
	lemon/random.cc \
alpar@482
    17
	lemon/bits/windows.cc
alpar@10
    18
alpar@639
    19
nodist_lemon_HEADERS = lemon/config.h	
alpar@667
    20
deba@458
    21
lemon_libemon_la_CXXFLAGS = \
alpar@550
    22
	$(AM_CXXFLAGS) \
deba@458
    23
	$(GLPK_CFLAGS) \
deba@458
    24
	$(CPLEX_CFLAGS) \
deba@459
    25
	$(SOPLEX_CXXFLAGS) \
deba@567
    26
	$(CLP_CXXFLAGS) \
deba@567
    27
	$(CBC_CXXFLAGS)
ladanyi@1
    28
deba@458
    29
lemon_libemon_la_LDFLAGS = \
deba@458
    30
	$(GLPK_LIBS) \
deba@458
    31
	$(CPLEX_LIBS) \
deba@459
    32
	$(SOPLEX_LIBS) \
deba@567
    33
	$(CLP_LIBS) \
deba@567
    34
	$(CBC_LIBS)
deba@458
    35
deba@458
    36
if HAVE_GLPK
alpar@461
    37
lemon_libemon_la_SOURCES += lemon/glpk.cc
deba@458
    38
endif
deba@458
    39
deba@458
    40
if HAVE_CPLEX
alpar@461
    41
lemon_libemon_la_SOURCES += lemon/cplex.cc
deba@458
    42
endif
deba@458
    43
deba@458
    44
if HAVE_SOPLEX
alpar@461
    45
lemon_libemon_la_SOURCES += lemon/soplex.cc
deba@458
    46
endif
ladanyi@259
    47
deba@459
    48
if HAVE_CLP
alpar@461
    49
lemon_libemon_la_SOURCES += lemon/clp.cc
deba@459
    50
endif
deba@220
    51
deba@567
    52
if HAVE_CBC
deba@567
    53
lemon_libemon_la_SOURCES += lemon/cbc.cc
deba@567
    54
endif
ladanyi@501
    55
alpar@2
    56
lemon_HEADERS += \
deba@416
    57
	lemon/adaptors.h \
alpar@440
    58
	lemon/arg_parser.h \
deba@108
    59
	lemon/assert.h \
kpeter@696
    60
	lemon/bellman_ford.h \
alpar@440
    61
	lemon/bfs.h \
alpar@440
    62
	lemon/bin_heap.h \
kpeter@701
    63
	lemon/binom_heap.h \
deba@681
    64
	lemon/bucket_heap.h \
kpeter@805
    65
	lemon/capacity_scaling.h \
ladanyi@630
    66
	lemon/cbc.h \
alpar@440
    67
	lemon/circulation.h \
alpar@461
    68
	lemon/clp.h \
alpar@440
    69
	lemon/color.h \
alpar@166
    70
	lemon/concept_check.h \
ladanyi@522
    71
	lemon/connectivity.h \
kpeter@808
    72
	lemon/core.h \
kpeter@808
    73
	lemon/cost_scaling.h \
alpar@440
    74
	lemon/counter.h \
alpar@461
    75
	lemon/cplex.h \
alpar@440
    76
	lemon/dfs.h \
alpar@440
    77
	lemon/dijkstra.h \
alpar@440
    78
	lemon/dim2.h \
alpar@440
    79
	lemon/dimacs.h \
deba@468
    80
	lemon/edge_set.h \
alpar@379
    81
	lemon/elevator.h \
kpeter@66
    82
	lemon/error.h \
alpar@520
    83
	lemon/euler.h \
deba@681
    84
	lemon/fib_heap.h \
kpeter@701
    85
	lemon/fourary_heap.h \
deba@353
    86
	lemon/full_graph.h \
alpar@461
    87
	lemon/glpk.h \
alpar@545
    88
	lemon/gomory_hu.h \
alpar@440
    89
	lemon/graph_to_eps.h \
alpar@440
    90
	lemon/grid_graph.h \
kpeter@766
    91
	lemon/hartmann_orlin.h \
kpeter@764
    92
	lemon/howard.h \
kpeter@364
    93
	lemon/hypercube_graph.h \
kpeter@765
    94
	lemon/karp.h \
kpeter@701
    95
	lemon/kary_heap.h \
alpar@103
    96
	lemon/kruskal.h \
deba@409
    97
	lemon/hao_orlin.h \
deba@127
    98
	lemon/lgf_reader.h \
kpeter@195
    99
	lemon/lgf_writer.h \
kpeter@66
   100
	lemon/list_graph.h \
deba@458
   101
	lemon/lp.h \
deba@458
   102
	lemon/lp_base.h \
deba@458
   103
	lemon/lp_skeleton.h \
alpar@58
   104
	lemon/maps.h \
kpeter@594
   105
	lemon/matching.h \
alpar@68
   106
	lemon/math.h \
deba@490
   107
	lemon/min_cost_arborescence.h \
deba@348
   108
	lemon/nauty_reader.h \
kpeter@601
   109
	lemon/network_simplex.h \
kpeter@701
   110
	lemon/pairing_heap.h \
alpar@96
   111
	lemon/path.h \
alpar@389
   112
	lemon/preflow.h \
deba@681
   113
	lemon/radix_heap.h \
deba@441
   114
	lemon/radix_sort.h \
alpar@440
   115
	lemon/random.h \
deba@109
   116
	lemon/smart_graph.h \
alpar@461
   117
	lemon/soplex.h \
kpeter@773
   118
	lemon/static_graph.h \
alpar@345
   119
	lemon/suurballe.h \
alpar@440
   120
	lemon/time_measure.h \
alpar@440
   121
	lemon/tolerance.h \
alpar@482
   122
	lemon/unionfind.h \
alpar@482
   123
	lemon/bits/windows.h
ladanyi@1
   124
alpar@7
   125
bits_HEADERS += \
deba@57
   126
	lemon/bits/alteration_notifier.h \
deba@57
   127
	lemon/bits/array_map.h \
alpar@440
   128
	lemon/bits/bezier.h \
deba@57
   129
	lemon/bits/default_map.h \
deba@468
   130
	lemon/bits/edge_set_extender.h \
alpar@440
   131
	lemon/bits/enable_if.h \
deba@414
   132
	lemon/bits/graph_adaptor_extender.h \
alpar@58
   133
	lemon/bits/graph_extender.h \
deba@57
   134
	lemon/bits/map_extender.h \
alpar@100
   135
	lemon/bits/path_dump.h \
deba@459
   136
	lemon/bits/solver_bits.h \
alpar@58
   137
	lemon/bits/traits.h \
deba@414
   138
	lemon/bits/variant.h \
deba@57
   139
	lemon/bits/vector_map.h
ladanyi@1
   140
alpar@58
   141
concept_HEADERS += \
deba@57
   142
	lemon/concepts/digraph.h \
deba@57
   143
	lemon/concepts/graph.h \
kpeter@195
   144
	lemon/concepts/graph_components.h \
alpar@100
   145
	lemon/concepts/heap.h \
alpar@58
   146
	lemon/concepts/maps.h \
kpeter@195
   147
	lemon/concepts/path.h