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.
5 pkgconfig_DATA += lemon/lemon.pc
7 lib_LTLIBRARIES += lemon/libemon.la
9 lemon_libemon_la_SOURCES = \
12 lemon/lp_skeleton.cc \
16 lemon/bits/mingw32_time.cc \
19 lemon_libemon_la_CXXFLAGS = $(GLPK_CFLAGS) $(CPLEX_CFLAGS) $(SOPLEX_CXXFLAGS)
20 lemon_libemon_la_LDFLAGS = $(GLPK_LIBS) $(CPLEX_LIBS) $(SOPLEX_LIBS)
23 lemon_libemon_la_SOURCES += lemon/lp_glpk.cc
24 lemon_libemon_la_SOURCES += lemon/mip_glpk.cc
28 lemon_libemon_la_SOURCES += lemon/lp_cplex.cc
29 lemon_libemon_la_SOURCES += lemon/mip_cplex.cc
33 lemon_libemon_la_SOURCES += lemon/lp_soplex.cc
38 lemon/bellman_ford.h \
41 lemon/bipartite_matching.h \
42 lemon/bpugraph_adaptor.h \
44 lemon/capacity_scaling.h \
48 lemon/concept_check.h \
51 lemon/cycle_canceling.h \
52 lemon/dag_shortest_path.h \
55 lemon/dinitz_sleator_tarjan.h \
59 lemon/dynamic_tree.h \
61 lemon/edmonds_karp.h \
67 lemon/floyd_warshall.h \
68 lemon/fredman_tarjan.h \
70 lemon/graph_adaptor.h \
71 lemon/graph_reader.h \
72 lemon/graph_to_eps.h \
74 lemon/graph_writer.h \
76 lemon/goldberg_tarjan.h \
77 lemon/gomory_hu_tree.h \
79 lemon/hypercube_graph.h \
80 lemon/iterable_maps.h \
83 lemon/lemon_reader.h \
84 lemon/lemon_writer.h \
93 lemon/map_iterator.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 \
104 lemon/nagamochi_ibaraki.h \
105 lemon/nauty_reader.h \
106 lemon/network_simplex.h \
113 lemon/pr_bipartite_matching.h \
119 lemon/smart_graph.h \
120 lemon/ssp_min_cost_flow.h \
121 lemon/static_graph.h \
125 lemon/tabu_search.h \
126 lemon/time_measure.h \
129 lemon/ugraph_adaptor.h \
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 \
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
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