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 

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 \

	config.h \

	counter.h \

	dijkstra.h \

	dimacs.h \

	dag_shortest_path.h \

	edge_set.h \

	error.h \

	fib_heap.h \

	floyd_warshall.h \

	fredman_tarjan.h \

	full_graph.h \

	grid_graph.h \

	graph_adaptor.h \

	graph_utils.h \

	graph_to_eps.h \

	hypercube_graph.h \

	invalid.h \

	iterable_maps.h \

	johnson.h \

	kruskal.h \

	linear_heap.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_flow.h \

	suurballe.h \

	preflow.h \

	path.h \

	prim.h \

	radix_heap.h \

	radix_sort.h \

	simann.h \

	smart_graph.h \

	sub_graph.h \

	time_measure.h \

	topology.h \

	traits.h \

	unionfind.h \

	xy.h \

	concept_check.h \

	utility.h \

	lemon_reader.h \

	lemon_writer.h \

	graph_reader.h \

	graph_writer.h \

	tolerance.h \

	bits/alteration_notifier.h \

	bits/array_map.h \

	bits/default_map.h \

	bits/vector_map.h \

	bits/iterable_graph_extender.h \

	bits/extendable_graph_extender.h \

	bits/clearable_graph_extender.h \

	bits/erasable_graph_extender.h \

	bits/graph_extender.h \

	bits/map_extender.h \

	bits/static_map.h \

	bits/item_reader.h \

	bits/item_writer.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