lemon/Makefile.am
author hegyi
Mon, 21 Nov 2005 18:03:20 +0000
changeset 1823 cb082cdf3667
parent 1811 597ce92fae73
child 1824 3a15b39a7c78
permissions -rw-r--r--
NewMapWin has become Dialog instead of Window. Therefore it is created dynamically, when there is need for it, instead of keeping one instance in memory. This solution is slower, but more correct than before.
ladanyi@1435
     1
AM_CPPFLAGS = -I$(top_srcdir)
ladanyi@1304
     2
ladanyi@1304
     3
pkgconfigdir = $(libdir)/pkgconfig
ladanyi@1304
     4
pkgconfig_DATA = lemon.pc
ladanyi@1304
     5
ladanyi@1304
     6
lib_LTLIBRARIES = libemon.la
ladanyi@1349
     7
ladanyi@1349
     8
libemon_la_SOURCES = \
ladanyi@1349
     9
	lp_base.cc \
alpar@1313
    10
	lp_skeleton.cc
ladanyi@1386
    11
libemon_la_CXXFLAGS = $(GLPK_CFLAGS) $(CPLEX_CFLAGS)
ladanyi@1386
    12
libemon_la_LDFLAGS = $(GLPK_LIBS) $(CPLEX_LIBS)
ladanyi@1304
    13
ladanyi@1349
    14
if HAVE_GLPK
ladanyi@1349
    15
libemon_la_SOURCES += lp_glpk.cc
ladanyi@1349
    16
endif
ladanyi@596
    17
alpar@1381
    18
if HAVE_CPLEX
alpar@1381
    19
libemon_la_SOURCES += lp_cplex.cc
alpar@1381
    20
endif
alpar@1381
    21
alpar@1378
    22
nobase_pkginclude_HEADERS = \
deba@1700
    23
	belmann_ford.h \
ladanyi@1349
    24
	bezier.h \
ladanyi@1349
    25
	bfs.h \
ladanyi@1349
    26
	dfs.h \
ladanyi@1349
    27
	bin_heap.h \
ladanyi@1433
    28
	config.h \
ladanyi@1349
    29
	dijkstra.h \
ladanyi@1349
    30
	dimacs.h \
ladanyi@1349
    31
	error.h \
ladanyi@1349
    32
	fib_heap.h \
deba@1700
    33
	floyd_warshall.h \
ladanyi@1349
    34
	full_graph.h \
deba@1625
    35
	grid_graph.h \
alpar@1401
    36
	graph_adaptor.h \
ladanyi@1349
    37
	graph_utils.h \
ladanyi@1349
    38
	graph_to_eps.h \
deba@1693
    39
	hypercube_graph.h \
ladanyi@1349
    40
	invalid.h \
alpar@1677
    41
	iterable_maps.h \
deba@1700
    42
	johnson.h \
ladanyi@1349
    43
	kruskal.h \
deba@1724
    44
	linear_heap.h \
ladanyi@1349
    45
	list_graph.h \
alpar@1629
    46
	lp.h \
alpar@1378
    47
	lp_base.h \
alpar@1381
    48
	lp_cplex.h \
alpar@1378
    49
	lp_glpk.h \
alpar@1378
    50
	lp_skeleton.h \
ladanyi@1349
    51
	maps.h \
deba@1724
    52
	matrix_maps.h \
ladanyi@1349
    53
	max_matching.h \
ladanyi@1349
    54
	min_cost_flow.h \
ladanyi@1349
    55
	suurballe.h \
ladanyi@1349
    56
	preflow.h \
ladanyi@1349
    57
	path.h \
ladanyi@1349
    58
	radix_heap.h \
ladanyi@1349
    59
	smart_graph.h \
ladanyi@1349
    60
	time_measure.h \
deba@1700
    61
	topology.h \
deba@1724
    62
	traits.h \
ladanyi@1349
    63
	unionfind.h \
ladanyi@1349
    64
	xy.h \
ladanyi@1349
    65
	concept_check.h \
ladanyi@1349
    66
	utility.h \
deba@1408
    67
	lemon_reader.h \
deba@1409
    68
	lemon_writer.h \
ladanyi@1349
    69
	graph_reader.h \
ladanyi@1349
    70
	graph_writer.h \
ladanyi@1349
    71
	bits/alteration_notifier.h \
ladanyi@1349
    72
	bits/array_map.h \
ladanyi@1349
    73
	bits/default_map.h \
ladanyi@1349
    74
	bits/extended_pair.h \
ladanyi@1349
    75
	bits/vector_map.h \
ladanyi@1349
    76
	bits/iterable_graph_extender.h \
ladanyi@1349
    77
	bits/extendable_graph_extender.h \
ladanyi@1349
    78
	bits/clearable_graph_extender.h \
ladanyi@1349
    79
	bits/erasable_graph_extender.h \
klao@1795
    80
	bits/graph_extender.h \
alpar@1815
    81
	bits/map_extender.h \
deba@1707
    82
	bits/static_map.h \
deba@1409
    83
	bits/item_reader.h \
alpar@1488
    84
	bits/item_writer.h \
ladanyi@1349
    85
	concept/graph.h \
ladanyi@1349
    86
	concept/graph_component.h \
ladanyi@1349
    87
	concept/undir_graph.h \
deba@1724
    88
	concept/matrix_maps.h \
ladanyi@1349
    89
	concept/maps.h \
ladanyi@1349
    90
	concept/heap.h \
klao@959
    91
	concept/path.h