lemon/Makefile.am
author Peter Kovacs <kpeter@inf.elte.hu>
Thu, 12 Nov 2009 23:26:13 +0100
changeset 806 fa6f37d7a25b
parent 780 580af8cf2f6a
child 808 9c428bb2b105
permissions -rw-r--r--
Entirely rework CapacityScaling (#180)

- Use the new interface similarly to NetworkSimplex.
- Rework the implementation using an efficient internal structure
for handling the residual network. This improvement made the
code much faster (up to 2-5 times faster on large graphs).
- Handle GEQ supply type (LEQ is not supported).
- Handle negative costs for arcs of finite capacity.
(Note that this algorithm cannot handle arcs of negative cost
and infinite upper bound, thus it returns UNBOUNDED if such
an arc exists.)
- Extend the documentation.
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@491
    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@512
    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 \
alpar@440
    72
	lemon/counter.h \
deba@220
    73
	lemon/core.h \
alpar@461
    74
	lemon/cplex.h \
alpar@440
    75
	lemon/dfs.h \
alpar@440
    76
	lemon/dijkstra.h \
alpar@440
    77
	lemon/dim2.h \
alpar@440
    78
	lemon/dimacs.h \
deba@468
    79
	lemon/edge_set.h \
alpar@379
    80
	lemon/elevator.h \
kpeter@66
    81
	lemon/error.h \
alpar@520
    82
	lemon/euler.h \
deba@681
    83
	lemon/fib_heap.h \
kpeter@701
    84
	lemon/fourary_heap.h \
deba@353
    85
	lemon/full_graph.h \
alpar@461
    86
	lemon/glpk.h \
alpar@545
    87
	lemon/gomory_hu.h \
alpar@440
    88
	lemon/graph_to_eps.h \
alpar@440
    89
	lemon/grid_graph.h \
kpeter@766
    90
	lemon/hartmann_orlin.h \
kpeter@764
    91
	lemon/howard.h \
kpeter@364
    92
	lemon/hypercube_graph.h \
kpeter@765
    93
	lemon/karp.h \
kpeter@701
    94
	lemon/kary_heap.h \
alpar@103
    95
	lemon/kruskal.h \
deba@409
    96
	lemon/hao_orlin.h \
deba@127
    97
	lemon/lgf_reader.h \
kpeter@195
    98
	lemon/lgf_writer.h \
kpeter@66
    99
	lemon/list_graph.h \
deba@458
   100
	lemon/lp.h \
deba@458
   101
	lemon/lp_base.h \
deba@458
   102
	lemon/lp_skeleton.h \
alpar@58
   103
	lemon/maps.h \
kpeter@594
   104
	lemon/matching.h \
alpar@68
   105
	lemon/math.h \
deba@501
   106
	lemon/min_cost_arborescence.h \
deba@348
   107
	lemon/nauty_reader.h \
kpeter@601
   108
	lemon/network_simplex.h \
kpeter@701
   109
	lemon/pairing_heap.h \
alpar@96
   110
	lemon/path.h \
alpar@389
   111
	lemon/preflow.h \
deba@681
   112
	lemon/radix_heap.h \
deba@441
   113
	lemon/radix_sort.h \
alpar@440
   114
	lemon/random.h \
deba@109
   115
	lemon/smart_graph.h \
alpar@461
   116
	lemon/soplex.h \
kpeter@773
   117
	lemon/static_graph.h \
alpar@345
   118
	lemon/suurballe.h \
alpar@440
   119
	lemon/time_measure.h \
alpar@440
   120
	lemon/tolerance.h \
alpar@491
   121
	lemon/unionfind.h \
alpar@491
   122
	lemon/bits/windows.h
ladanyi@1
   123
alpar@7
   124
bits_HEADERS += \
deba@57
   125
	lemon/bits/alteration_notifier.h \
deba@57
   126
	lemon/bits/array_map.h \
alpar@440
   127
	lemon/bits/bezier.h \
deba@57
   128
	lemon/bits/default_map.h \
deba@468
   129
	lemon/bits/edge_set_extender.h \
alpar@440
   130
	lemon/bits/enable_if.h \
deba@414
   131
	lemon/bits/graph_adaptor_extender.h \
alpar@58
   132
	lemon/bits/graph_extender.h \
deba@57
   133
	lemon/bits/map_extender.h \
alpar@100
   134
	lemon/bits/path_dump.h \
deba@459
   135
	lemon/bits/solver_bits.h \
alpar@58
   136
	lemon/bits/traits.h \
deba@414
   137
	lemon/bits/variant.h \
deba@57
   138
	lemon/bits/vector_map.h
ladanyi@1
   139
alpar@58
   140
concept_HEADERS += \
deba@57
   141
	lemon/concepts/digraph.h \
deba@57
   142
	lemon/concepts/graph.h \
kpeter@195
   143
	lemon/concepts/graph_components.h \
alpar@100
   144
	lemon/concepts/heap.h \
alpar@58
   145
	lemon/concepts/maps.h \
kpeter@195
   146
	lemon/concepts/path.h