ladanyi@1435: AM_CPPFLAGS = -I$(top_srcdir)
ladanyi@1304: 
ladanyi@1304: pkgconfigdir = $(libdir)/pkgconfig
ladanyi@1304: pkgconfig_DATA = lemon.pc
ladanyi@1304: 
ladanyi@1304: lib_LTLIBRARIES = libemon.la
ladanyi@1349: 
ladanyi@1349: libemon_la_SOURCES = \
ladanyi@1349: 	lp_base.cc \
alpar@1835: 	lp_skeleton.cc \
alpar@1971: 	base.cc \
deba@2035: 	eps.cc \
deba@2035: 	bits/mingw32_rand.cc \
deba@2035: 	bits/mingw32_time.cc
deba@2035: 
ladanyi@1386: libemon_la_CXXFLAGS = $(GLPK_CFLAGS) $(CPLEX_CFLAGS)
ladanyi@1386: libemon_la_LDFLAGS = $(GLPK_LIBS) $(CPLEX_LIBS)
ladanyi@1304: 
ladanyi@1349: if HAVE_GLPK
ladanyi@1349: libemon_la_SOURCES += lp_glpk.cc
ladanyi@1349: endif
ladanyi@596: 
alpar@1381: if HAVE_CPLEX
alpar@1381: libemon_la_SOURCES += lp_cplex.cc
alpar@1381: endif
alpar@1381: 
alpar@1378: nobase_pkginclude_HEADERS = \
deba@1864: 	bellman_ford.h \
ladanyi@1349: 	bezier.h \
ladanyi@1349: 	bfs.h \
ladanyi@1349: 	bin_heap.h \
alpar@2086: 	bipartite_matching.h \
alpar@2086: 	bits/alteration_notifier.h \
alpar@2086: 	bits/array_map.h \
alpar@2086: 	bits/base_extender.h \
alpar@2086: 	bits/default_map.h \
alpar@2086: 	bits/edge_set_extender.h \
alpar@2086: 	bits/graph_adaptor_extender.h \
alpar@2086: 	bits/graph_extender.h \
alpar@2086: 	bits/invalid.h \
alpar@2086: 	bits/item_reader.h \
alpar@2086: 	bits/item_writer.h \
alpar@2086: 	bits/map_extender.h \
alpar@2086: 	bits/mingw32_rand.h \
alpar@2086: 	bits/mingw32_time.h \
alpar@2086: 	bits/traits.h \
alpar@2086: 	bits/utility.h \
alpar@2086: 	bits/vector_map.h \
deba@2031: 	bpugraph_adaptor.h \
deba@2040: 	bucket_heap.h \
alpar@1971: 	color.h \
alpar@2086: 	concept_check.h \
alpar@2086: 	concept/bpugraph.h \
alpar@2086: 	concept/graph.h \
alpar@2086: 	concept/graph_component.h \
alpar@2086: 	concept/heap.h \
alpar@2086: 	concept/maps.h \
alpar@2086: 	concept/matrix_maps.h \
alpar@2095: 	concept/path.h \
alpar@2086: 	concept/ugraph.h \
ladanyi@1433: 	config.h \
alpar@1847: 	counter.h \
alpar@2086: 	dag_shortest_path.h \
alpar@2086: 	dfs.h \
ladanyi@1349: 	dijkstra.h \
ladanyi@1349: 	dimacs.h \
deba@1842: 	edge_set.h \
deba@2034: 	edmonds_karp.h \
alpar@2086: 	eps.h \
ladanyi@1349: 	error.h \
ladanyi@1349: 	fib_heap.h \
deba@1700: 	floyd_warshall.h \
deba@1912: 	fredman_tarjan.h \
ladanyi@1349: 	full_graph.h \
alpar@2086: 	graph_adaptor.h \
alpar@2086: 	graph_reader.h \
alpar@2086: 	graph_to_eps.h \
alpar@2086: 	graph_utils.h \
alpar@2086: 	graph_writer.h \
deba@1979: 	grid_ugraph.h \
deba@1693: 	hypercube_graph.h \
alpar@1677: 	iterable_maps.h \
deba@1700: 	johnson.h \
ladanyi@1349: 	kruskal.h \
alpar@2086: 	lemon_reader.h \
alpar@2086: 	lemon_writer.h \
ladanyi@1349: 	list_graph.h \
alpar@1629: 	lp.h \
alpar@1378: 	lp_base.h \
alpar@1381: 	lp_cplex.h \
alpar@1378: 	lp_glpk.h \
alpar@1378: 	lp_skeleton.h \
alpar@2086: 	map_iterator.h \
ladanyi@1349: 	maps.h \
deba@1724: 	matrix_maps.h \
ladanyi@1349: 	max_matching.h \
deba@2017: 	min_cost_arborescence.h \
ladanyi@1349: 	min_cost_flow.h \
deba@1975: 	min_cut.h \
alpar@2086: 	path.h \
alpar@2086: 	polynomial.h \
ladanyi@1349: 	preflow.h \
deba@1912: 	prim.h \
ladanyi@1349: 	radix_heap.h \
deba@1833: 	radix_sort.h \
alpar@1977: 	refptr.h \
ladanyi@1923: 	simann.h \
ladanyi@1349: 	smart_graph.h \
deba@1866: 	sub_graph.h \
alpar@2086: 	suurballe.h \
deba@2067: 	tabu_search.h \
ladanyi@1349: 	time_measure.h \
alpar@2086: 	tolerance.h \
deba@1700: 	topology.h \
deba@1979: 	ugraph_adaptor.h \
ladanyi@1349: 	unionfind.h \
alpar@2086: 	xy.h