AM_CPPFLAGS = -I$(top_srcdir) pkgconfigdir = $(libdir)/pkgconfig pkgconfig_DATA = lemon.pc lib_LTLIBRARIES = libemon.la libemon_la_SOURCES = \ lp_base.cc \ lp_skeleton.cc \ base.cc \ eps.cc \ bits/mingw32_rand.cc \ bits/mingw32_time.cc libemon_la_CXXFLAGS = $(GLPK_CFLAGS) $(CPLEX_CFLAGS) libemon_la_LDFLAGS = $(GLPK_LIBS) $(CPLEX_LIBS) if HAVE_GLPK libemon_la_SOURCES += lp_glpk.cc endif if HAVE_CPLEX libemon_la_SOURCES += lp_cplex.cc endif nobase_pkginclude_HEADERS = \ bellman_ford.h \ bezier.h \ bfs.h \ dfs.h \ bin_heap.h \ bpugraph_adaptor.h \ bipartite_matching.h \ bucket_heap.h \ color.h \ config.h \ counter.h \ dijkstra.h \ dimacs.h \ dag_shortest_path.h \ edge_set.h \ edmonds_karp.h \ error.h \ eps.h \ fib_heap.h \ floyd_warshall.h \ fredman_tarjan.h \ full_graph.h \ grid_ugraph.h \ graph_adaptor.h \ graph_utils.h \ graph_to_eps.h \ hypercube_graph.h \ iterable_maps.h \ johnson.h \ kruskal.h \ list_graph.h \ lp.h \ lp_base.h \ lp_cplex.h \ lp_glpk.h \ lp_skeleton.h \ maps.h \ matrix_maps.h \ map_iterator.h \ max_matching.h \ min_cost_arborescence.h \ min_cost_flow.h \ min_cut.h \ suurballe.h \ preflow.h \ path.h \ prim.h \ radix_heap.h \ radix_sort.h \ refptr.h \ simann.h \ smart_graph.h \ sub_graph.h \ time_measure.h \ topology.h \ ugraph_adaptor.h \ unionfind.h \ xy.h \ concept_check.h \ lemon_reader.h \ lemon_writer.h \ graph_reader.h \ graph_writer.h \ tolerance.h \ bits/alteration_notifier.h \ bits/array_map.h \ bits/base_extender.h \ bits/default_map.h \ bits/vector_map.h \ bits/map_extender.h \ bits/graph_extender.h \ bits/graph_adaptor_extender.h \ bits/edge_set_extender.h \ bits/invalid.h \ bits/item_reader.h \ bits/item_writer.h \ bits/traits.h \ bits/utility.h \ bits/mingw32_rand.h \ bits/mingw32_time.h \ concept/bpugraph.h \ concept/graph.h \ concept/graph_component.h \ concept/ugraph.h \ concept/matrix_maps.h \ concept/maps.h \ concept/heap.h \ concept/path.h