lemon/Makefile.am
author Peter Kovacs <kpeter@inf.elte.hu>
Tue, 24 Mar 2009 00:18:25 +0100
changeset 596 8c3112a66878
parent 513 88bd39ef7d98
child 603 85cb3aa71cce
permissions -rw-r--r--
Use XTI implementation instead of ATI in NetworkSimplex (#234)

XTI (eXtended Threaded Index) is an imporved version of the widely
known ATI (Augmented Threaded Index) method for storing and updating
the spanning tree structure in Network Simplex algorithms.

In the ATI data structure three indices are stored for each node:
predecessor, thread and depth. In the XTI data structure depth is
replaced by the number of successors and the last successor
(according to the thread index).
ladanyi@1
     1
EXTRA_DIST += \
ladanyi@146
     2
	lemon/lemon.pc.in \
ladanyi@146
     3
	lemon/CMakeLists.txt
ladanyi@1
     4
ladanyi@1
     5
pkgconfig_DATA += lemon/lemon.pc
ladanyi@1
     6
ladanyi@1
     7
lib_LTLIBRARIES += lemon/libemon.la
ladanyi@1
     8
alpar@7
     9
lemon_libemon_la_SOURCES = \
alpar@440
    10
	lemon/arg_parser.cc \
alpar@440
    11
	lemon/base.cc \
alpar@440
    12
	lemon/color.cc \
deba@458
    13
	lemon/lp_base.cc \
deba@458
    14
	lemon/lp_skeleton.cc \
alpar@491
    15
        lemon/random.cc \
alpar@491
    16
	lemon/bits/windows.cc
alpar@10
    17
deba@458
    18
deba@458
    19
lemon_libemon_la_CXXFLAGS = \
deba@458
    20
	$(GLPK_CFLAGS) \
deba@458
    21
	$(CPLEX_CFLAGS) \
deba@459
    22
	$(SOPLEX_CXXFLAGS) \
deba@459
    23
	$(CLP_CXXFLAGS)
deba@458
    24
deba@458
    25
lemon_libemon_la_LDFLAGS = \
deba@458
    26
	$(GLPK_LIBS) \
deba@458
    27
	$(CPLEX_LIBS) \
deba@459
    28
	$(SOPLEX_LIBS) \
deba@459
    29
	$(CLP_LIBS)
deba@458
    30
deba@458
    31
if HAVE_GLPK
alpar@461
    32
lemon_libemon_la_SOURCES += lemon/glpk.cc
deba@458
    33
endif
deba@458
    34
deba@458
    35
if HAVE_CPLEX
alpar@461
    36
lemon_libemon_la_SOURCES += lemon/cplex.cc
deba@458
    37
endif
deba@458
    38
deba@458
    39
if HAVE_SOPLEX
alpar@461
    40
lemon_libemon_la_SOURCES += lemon/soplex.cc
deba@458
    41
endif
ladanyi@259
    42
deba@459
    43
if HAVE_CLP
alpar@461
    44
lemon_libemon_la_SOURCES += lemon/clp.cc
deba@459
    45
endif
ladanyi@1
    46
alpar@2
    47
lemon_HEADERS += \
deba@416
    48
	lemon/adaptors.h \
alpar@440
    49
	lemon/arg_parser.h \
deba@108
    50
	lemon/assert.h \
alpar@440
    51
	lemon/bfs.h \
alpar@440
    52
	lemon/bin_heap.h \
alpar@440
    53
	lemon/circulation.h \
alpar@461
    54
	lemon/clp.h \
alpar@440
    55
	lemon/color.h \
alpar@166
    56
	lemon/concept_check.h \
ladanyi@506
    57
	lemon/connectivity.h \
alpar@440
    58
	lemon/counter.h \
deba@220
    59
	lemon/core.h \
alpar@461
    60
	lemon/cplex.h \
alpar@440
    61
	lemon/dfs.h \
alpar@440
    62
	lemon/dijkstra.h \
alpar@440
    63
	lemon/dim2.h \
alpar@440
    64
	lemon/dimacs.h \
deba@468
    65
	lemon/edge_set.h \
alpar@379
    66
	lemon/elevator.h \
kpeter@66
    67
	lemon/error.h \
alpar@504
    68
	lemon/euler.h \
deba@353
    69
	lemon/full_graph.h \
alpar@461
    70
	lemon/glpk.h \
alpar@440
    71
	lemon/graph_to_eps.h \
alpar@440
    72
	lemon/grid_graph.h \
kpeter@364
    73
	lemon/hypercube_graph.h \
alpar@103
    74
	lemon/kruskal.h \
deba@409
    75
	lemon/hao_orlin.h \
deba@127
    76
	lemon/lgf_reader.h \
kpeter@195
    77
	lemon/lgf_writer.h \
kpeter@66
    78
	lemon/list_graph.h \
deba@458
    79
	lemon/lp.h \
deba@458
    80
	lemon/lp_base.h \
deba@458
    81
	lemon/lp_skeleton.h \
deba@459
    82
	lemon/list_graph.h \
alpar@58
    83
	lemon/maps.h \
alpar@68
    84
	lemon/math.h \
deba@326
    85
	lemon/max_matching.h \
deba@512
    86
	lemon/min_cost_arborescence.h \
deba@348
    87
	lemon/nauty_reader.h \
kpeter@593
    88
	lemon/network_simplex.h \
alpar@96
    89
	lemon/path.h \
alpar@389
    90
	lemon/preflow.h \
deba@441
    91
	lemon/radix_sort.h \
alpar@440
    92
	lemon/random.h \
deba@109
    93
	lemon/smart_graph.h \
alpar@461
    94
	lemon/soplex.h \
alpar@345
    95
	lemon/suurballe.h \
alpar@440
    96
	lemon/time_measure.h \
alpar@440
    97
	lemon/tolerance.h \
alpar@491
    98
	lemon/unionfind.h \
alpar@491
    99
	lemon/bits/windows.h
ladanyi@1
   100
alpar@7
   101
bits_HEADERS += \
deba@57
   102
	lemon/bits/alteration_notifier.h \
deba@57
   103
	lemon/bits/array_map.h \
deba@57
   104
	lemon/bits/base_extender.h \
alpar@440
   105
	lemon/bits/bezier.h \
deba@57
   106
	lemon/bits/default_map.h \
deba@468
   107
	lemon/bits/edge_set_extender.h \
alpar@440
   108
	lemon/bits/enable_if.h \
deba@414
   109
	lemon/bits/graph_adaptor_extender.h \
alpar@58
   110
	lemon/bits/graph_extender.h \
deba@57
   111
	lemon/bits/map_extender.h \
alpar@100
   112
	lemon/bits/path_dump.h \
deba@459
   113
	lemon/bits/solver_bits.h \
alpar@58
   114
	lemon/bits/traits.h \
deba@414
   115
	lemon/bits/variant.h \
deba@57
   116
	lemon/bits/vector_map.h
ladanyi@1
   117
alpar@58
   118
concept_HEADERS += \
deba@57
   119
	lemon/concepts/digraph.h \
deba@57
   120
	lemon/concepts/graph.h \
kpeter@195
   121
	lemon/concepts/graph_components.h \
alpar@100
   122
	lemon/concepts/heap.h \
alpar@58
   123
	lemon/concepts/maps.h \
kpeter@195
   124
	lemon/concepts/path.h