1.1 --- a/src/lemon/Makefile.am Wed Apr 13 06:49:42 2005 +0000
1.2 +++ b/src/lemon/Makefile.am Thu Apr 14 12:02:14 2005 +0000
1.3 @@ -4,63 +4,69 @@
1.4 pkgconfig_DATA = lemon.pc
1.5
1.6 lib_LTLIBRARIES = libemon.la
1.7 -libemon_la_SOURCES = \
1.8 - lp_base.cc \
1.9 - lp_glpk.cc \
1.10 +
1.11 +libemon_la_SOURCES = \
1.12 + lp_base.cc \
1.13 lp_skeleton.cc
1.14
1.15 -pkginclude_HEADERS = \
1.16 - bezier.h \
1.17 - bfs.h \
1.18 - dfs.h \
1.19 - bin_heap.h \
1.20 - dijkstra.h \
1.21 - dimacs.h \
1.22 - error.h \
1.23 - fib_heap.h \
1.24 - full_graph.h \
1.25 - graph_wrapper.h \
1.26 - graph_utils.h \
1.27 - graph_to_eps.h \
1.28 - invalid.h \
1.29 - kruskal.h \
1.30 - list_graph.h \
1.31 - maps.h \
1.32 - max_matching.h \
1.33 - min_cost_flow.h \
1.34 - suurballe.h \
1.35 - preflow.h \
1.36 - path.h \
1.37 - radix_heap.h \
1.38 - smart_graph.h \
1.39 - time_measure.h \
1.40 - unionfind.h \
1.41 - xy.h \
1.42 - concept_check.h \
1.43 - utility.h \
1.44 - graph_reader.h \
1.45 - graph_writer.h \
1.46 - map_utils.h \
1.47 - bits/alteration_notifier.h \
1.48 - bits/map_iterator.h \
1.49 - bits/array_map.h \
1.50 - bits/default_map.h \
1.51 - bits/extended_pair.h \
1.52 - bits/vector_map.h \
1.53 - bits/iterable_graph_extender.h \
1.54 - bits/extendable_graph_extender.h \
1.55 - bits/clearable_graph_extender.h \
1.56 - bits/erasable_graph_extender.h \
1.57 - bits/undir_graph_extender.h
1.58 +if HAVE_GLPK
1.59 +libemon_la_SOURCES += lp_glpk.cc
1.60 +libemon_la_CXXFLAGS = $(GLPK_CFLAGS)
1.61 +libemon_la_LDFLAGS = $(GLPK_LIBS)
1.62 +endif
1.63
1.64 -noinst_HEADERS = \
1.65 - lp_base.h \
1.66 - lp_glpk.h \
1.67 - lp_skeleton.h \
1.68 - concept/graph.h \
1.69 - concept/graph_component.h \
1.70 - concept/undir_graph.h \
1.71 - concept/sym_graph.h \
1.72 - concept/maps.h \
1.73 - concept/heap.h \
1.74 +pkginclude_HEADERS = \
1.75 + bezier.h \
1.76 + bfs.h \
1.77 + dfs.h \
1.78 + bin_heap.h \
1.79 + dijkstra.h \
1.80 + dimacs.h \
1.81 + error.h \
1.82 + fib_heap.h \
1.83 + full_graph.h \
1.84 + graph_wrapper.h \
1.85 + graph_utils.h \
1.86 + graph_to_eps.h \
1.87 + invalid.h \
1.88 + kruskal.h \
1.89 + list_graph.h \
1.90 + maps.h \
1.91 + max_matching.h \
1.92 + min_cost_flow.h \
1.93 + suurballe.h \
1.94 + preflow.h \
1.95 + path.h \
1.96 + radix_heap.h \
1.97 + smart_graph.h \
1.98 + time_measure.h \
1.99 + unionfind.h \
1.100 + xy.h \
1.101 + concept_check.h \
1.102 + utility.h \
1.103 + graph_reader.h \
1.104 + graph_writer.h \
1.105 + map_utils.h \
1.106 + bits/alteration_notifier.h \
1.107 + bits/map_iterator.h \
1.108 + bits/array_map.h \
1.109 + bits/default_map.h \
1.110 + bits/extended_pair.h \
1.111 + bits/vector_map.h \
1.112 + bits/iterable_graph_extender.h \
1.113 + bits/extendable_graph_extender.h \
1.114 + bits/clearable_graph_extender.h \
1.115 + bits/erasable_graph_extender.h \
1.116 + bits/undir_graph_extender.h
1.117 +
1.118 +noinst_HEADERS = \
1.119 + lp_base.h \
1.120 + lp_glpk.h \
1.121 + lp_skeleton.h \
1.122 + concept/graph.h \
1.123 + concept/graph_component.h \
1.124 + concept/undir_graph.h \
1.125 + concept/sym_graph.h \
1.126 + concept/maps.h \
1.127 + concept/heap.h \
1.128 concept/path.h