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).
     1 EXTRA_DIST += \
     2 	lemon/lemon.pc.in \
     3 	lemon/CMakeLists.txt
     4 
     5 pkgconfig_DATA += lemon/lemon.pc
     6 
     7 lib_LTLIBRARIES += lemon/libemon.la
     8 
     9 lemon_libemon_la_SOURCES = \
    10 	lemon/arg_parser.cc \
    11 	lemon/base.cc \
    12 	lemon/color.cc \
    13 	lemon/lp_base.cc \
    14 	lemon/lp_skeleton.cc \
    15         lemon/random.cc \
    16 	lemon/bits/windows.cc
    17 
    18 
    19 lemon_libemon_la_CXXFLAGS = \
    20 	$(GLPK_CFLAGS) \
    21 	$(CPLEX_CFLAGS) \
    22 	$(SOPLEX_CXXFLAGS) \
    23 	$(CLP_CXXFLAGS)
    24 
    25 lemon_libemon_la_LDFLAGS = \
    26 	$(GLPK_LIBS) \
    27 	$(CPLEX_LIBS) \
    28 	$(SOPLEX_LIBS) \
    29 	$(CLP_LIBS)
    30 
    31 if HAVE_GLPK
    32 lemon_libemon_la_SOURCES += lemon/glpk.cc
    33 endif
    34 
    35 if HAVE_CPLEX
    36 lemon_libemon_la_SOURCES += lemon/cplex.cc
    37 endif
    38 
    39 if HAVE_SOPLEX
    40 lemon_libemon_la_SOURCES += lemon/soplex.cc
    41 endif
    42 
    43 if HAVE_CLP
    44 lemon_libemon_la_SOURCES += lemon/clp.cc
    45 endif
    46 
    47 lemon_HEADERS += \
    48 	lemon/adaptors.h \
    49 	lemon/arg_parser.h \
    50 	lemon/assert.h \
    51 	lemon/bfs.h \
    52 	lemon/bin_heap.h \
    53 	lemon/circulation.h \
    54 	lemon/clp.h \
    55 	lemon/color.h \
    56 	lemon/concept_check.h \
    57 	lemon/connectivity.h \
    58 	lemon/counter.h \
    59 	lemon/core.h \
    60 	lemon/cplex.h \
    61 	lemon/dfs.h \
    62 	lemon/dijkstra.h \
    63 	lemon/dim2.h \
    64 	lemon/dimacs.h \
    65 	lemon/edge_set.h \
    66 	lemon/elevator.h \
    67 	lemon/error.h \
    68 	lemon/euler.h \
    69 	lemon/full_graph.h \
    70 	lemon/glpk.h \
    71 	lemon/graph_to_eps.h \
    72 	lemon/grid_graph.h \
    73 	lemon/hypercube_graph.h \
    74 	lemon/kruskal.h \
    75 	lemon/hao_orlin.h \
    76 	lemon/lgf_reader.h \
    77 	lemon/lgf_writer.h \
    78 	lemon/list_graph.h \
    79 	lemon/lp.h \
    80 	lemon/lp_base.h \
    81 	lemon/lp_skeleton.h \
    82 	lemon/list_graph.h \
    83 	lemon/maps.h \
    84 	lemon/math.h \
    85 	lemon/max_matching.h \
    86 	lemon/min_cost_arborescence.h \
    87 	lemon/nauty_reader.h \
    88 	lemon/network_simplex.h \
    89 	lemon/path.h \
    90 	lemon/preflow.h \
    91 	lemon/radix_sort.h \
    92 	lemon/random.h \
    93 	lemon/smart_graph.h \
    94 	lemon/soplex.h \
    95 	lemon/suurballe.h \
    96 	lemon/time_measure.h \
    97 	lemon/tolerance.h \
    98 	lemon/unionfind.h \
    99 	lemon/bits/windows.h
   100 
   101 bits_HEADERS += \
   102 	lemon/bits/alteration_notifier.h \
   103 	lemon/bits/array_map.h \
   104 	lemon/bits/base_extender.h \
   105 	lemon/bits/bezier.h \
   106 	lemon/bits/default_map.h \
   107 	lemon/bits/edge_set_extender.h \
   108 	lemon/bits/enable_if.h \
   109 	lemon/bits/graph_adaptor_extender.h \
   110 	lemon/bits/graph_extender.h \
   111 	lemon/bits/map_extender.h \
   112 	lemon/bits/path_dump.h \
   113 	lemon/bits/solver_bits.h \
   114 	lemon/bits/traits.h \
   115 	lemon/bits/variant.h \
   116 	lemon/bits/vector_map.h
   117 
   118 concept_HEADERS += \
   119 	lemon/concepts/digraph.h \
   120 	lemon/concepts/graph.h \
   121 	lemon/concepts/graph_components.h \
   122 	lemon/concepts/heap.h \
   123 	lemon/concepts/maps.h \
   124 	lemon/concepts/path.h