lemon/Makefile.am
author kpeter
Mon, 18 Feb 2008 03:32:06 +0000
changeset 2575 e866e288cba6
parent 2528 e6bc5c0032e9
child 2578 979a0b389f84
permissions -rw-r--r--
Major improvements in NetworkSimplex.

Main changes:
- Use -potenital[] instead of potential[] to conform to the usual
terminology.
- Use function parameter instead of #define commands to select pivot rule.
- Use much faster implementation for the candidate list pivot rule.
It is about 5-20 times faster now.
- Add a new pivot rule called "Limited Search" that is a modified
version of "Block Search". It is about 25 percent faster on rather
sparse graphs.
- By default "Limited Search" is used for sparse graphs and
"Block Search" is used otherwise. This combined method is the most
efficient on every input class.
- Change the name of private members to start with "_".
- Change the name of function parameters not to start with "_".
- Remove unnecessary documentation for private members.
- Many doc improvements.
     1 EXTRA_DIST += \
     2 	lemon/Makefile \
     3 	lemon/lemon.pc.in
     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/lp_base.cc \
    12 	lemon/lp_skeleton.cc \
    13 	lemon/base.cc \
    14 	lemon/color.cc \
    15 	lemon/eps.cc \
    16 	lemon/bits/mingw32_time.cc \
    17 	lemon/random.cc
    18 
    19 lemon_libemon_la_CXXFLAGS = $(GLPK_CFLAGS) $(CPLEX_CFLAGS) $(SOPLEX_CXXFLAGS)
    20 lemon_libemon_la_LDFLAGS = $(GLPK_LIBS) $(CPLEX_LIBS) $(SOPLEX_LIBS)
    21 
    22 if HAVE_GLPK
    23 lemon_libemon_la_SOURCES += lemon/lp_glpk.cc
    24 lemon_libemon_la_SOURCES += lemon/mip_glpk.cc
    25 endif
    26 
    27 if HAVE_CPLEX
    28 lemon_libemon_la_SOURCES += lemon/lp_cplex.cc
    29 lemon_libemon_la_SOURCES += lemon/mip_cplex.cc
    30 endif
    31 
    32 if HAVE_SOPLEX
    33 lemon_libemon_la_SOURCES += lemon/lp_soplex.cc
    34 endif
    35 
    36 lemon_HEADERS += \
    37 	lemon/arg_parser.h \
    38 	lemon/bellman_ford.h \
    39 	lemon/bfs.h \
    40 	lemon/bin_heap.h \
    41 	lemon/bipartite_matching.h \
    42 	lemon/bpugraph_adaptor.h \
    43 	lemon/bucket_heap.h \
    44 	lemon/capacity_scaling.h \
    45 	lemon/circulation.h \
    46 	lemon/color.h \
    47 	lemon/config.h \
    48 	lemon/concept_check.h \
    49 	lemon/counter.h \
    50 	lemon/csp.h \
    51 	lemon/cycle_canceling.h \
    52 	lemon/dag_shortest_path.h \
    53 	lemon/dfs.h \
    54 	lemon/dijkstra.h \
    55 	lemon/dinitz_sleator_tarjan.h \
    56 	lemon/dist_log.h \
    57 	lemon/dim2.h \
    58 	lemon/dimacs.h \
    59 	lemon/dynamic_tree.h \
    60 	lemon/edge_set.h \
    61 	lemon/edmonds_karp.h \
    62 	lemon/elevator.h \
    63 	lemon/eps.h \
    64 	lemon/error.h \
    65 	lemon/euler.h \
    66 	lemon/fib_heap.h \
    67 	lemon/floyd_warshall.h \
    68 	lemon/fredman_tarjan.h \
    69 	lemon/full_graph.h \
    70 	lemon/graph_adaptor.h \
    71 	lemon/graph_reader.h \
    72 	lemon/graph_to_eps.h \
    73 	lemon/graph_utils.h \
    74 	lemon/graph_writer.h \
    75 	lemon/grid_ugraph.h \
    76 	lemon/goldberg_tarjan.h \
    77 	lemon/gomory_hu_tree.h \
    78 	lemon/hao_orlin.h \
    79 	lemon/hypercube_graph.h \
    80 	lemon/iterable_maps.h \
    81 	lemon/johnson.h \
    82 	lemon/kruskal.h \
    83 	lemon/lemon_reader.h \
    84 	lemon/lemon_writer.h \
    85 	lemon/list_graph.h \
    86 	lemon/lp.h \
    87 	lemon/lp_base.h \
    88 	lemon/lp_cplex.h \
    89 	lemon/lp_glpk.h \
    90 	lemon/lp_skeleton.h \
    91 	lemon/lp_soplex.h \
    92 	lemon/lp_utils.h \
    93 	lemon/map_iterator.h \
    94 	lemon/maps.h \
    95 	lemon/math.h \
    96 	lemon/matrix_maps.h \
    97 	lemon/max_matching.h \
    98 	lemon/min_cost_arborescence.h \
    99 	lemon/min_cost_flow.h \
   100 	lemon/min_cost_max_flow.h \
   101 	lemon/min_mean_cycle.h \
   102 	lemon/mip_glpk.h \
   103 	lemon/mip_cplex.h \
   104 	lemon/nagamochi_ibaraki.h \
   105 	lemon/nauty_reader.h \
   106 	lemon/network_simplex.h \
   107 	lemon/path.h \
   108 	lemon/path_utils.h \
   109 	lemon/planarity.h \
   110 	lemon/polynomial.h \
   111 	lemon/preflow.h \
   112 	lemon/prim.h \
   113 	lemon/pr_bipartite_matching.h \
   114 	lemon/radix_heap.h \
   115 	lemon/radix_sort.h \
   116 	lemon/random.h \
   117 	lemon/refptr.h \
   118 	lemon/simann.h \
   119 	lemon/smart_graph.h \
   120 	lemon/ssp_min_cost_flow.h \
   121 	lemon/static_graph.h \
   122 	lemon/steiner.h \
   123 	lemon/sub_graph.h \
   124 	lemon/suurballe.h \
   125 	lemon/tabu_search.h \
   126 	lemon/time_measure.h \
   127 	lemon/tolerance.h \
   128 	lemon/topology.h \
   129 	lemon/ugraph_adaptor.h \
   130 	lemon/unionfind.h
   131 
   132 bits_HEADERS += \
   133 	lemon/bits/alteration_notifier.h \
   134 	lemon/bits/array_map.h \
   135 	lemon/bits/base_extender.h \
   136 	lemon/bits/bezier.h \
   137 	lemon/bits/debug_map.h \
   138 	lemon/bits/default_map.h \
   139 	lemon/bits/edge_set_extender.h \
   140 	lemon/bits/graph_adaptor_extender.h \
   141 	lemon/bits/graph_extender.h \
   142 	lemon/bits/invalid.h \
   143 	lemon/bits/item_reader.h \
   144 	lemon/bits/item_writer.h \
   145 	lemon/bits/lp_id.h \
   146 	lemon/bits/map_extender.h \
   147 	lemon/bits/mingw32_time.h \
   148 	lemon/bits/path_dump.h \
   149 	lemon/bits/traits.h \
   150 	lemon/bits/utility.h \
   151 	lemon/bits/variant.h \
   152 	lemon/bits/vector_map.h
   153 
   154 concept_HEADERS += \
   155 	lemon/concept_check.h \
   156 	lemon/concepts/bpugraph.h \
   157 	lemon/concepts/graph.h \
   158 	lemon/concepts/graph_components.h \
   159 	lemon/concepts/heap.h \
   160 	lemon/concepts/maps.h \
   161 	lemon/concepts/matrix_maps.h \
   162 	lemon/concepts/path.h \
   163 	lemon/concepts/ugraph.h