lemon/Makefile.am
author deba
Mon, 13 Feb 2006 09:42:53 +0000
changeset 1967 5d81ba873b90
parent 1923 e1b0ef823e9e
child 1968 78e6e2d1fd96
permissions -rw-r--r--
New algorithm:
MaxCardinalitySearch
MinimalCut // in UGraph
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@1835
    10
	lp_skeleton.cc \
alpar@1835
    11
	base.cc 
ladanyi@1386
    12
libemon_la_CXXFLAGS = $(GLPK_CFLAGS) $(CPLEX_CFLAGS)
ladanyi@1386
    13
libemon_la_LDFLAGS = $(GLPK_LIBS) $(CPLEX_LIBS)
ladanyi@1304
    14
ladanyi@1349
    15
if HAVE_GLPK
ladanyi@1349
    16
libemon_la_SOURCES += lp_glpk.cc
ladanyi@1349
    17
endif
ladanyi@596
    18
alpar@1381
    19
if HAVE_CPLEX
alpar@1381
    20
libemon_la_SOURCES += lp_cplex.cc
alpar@1381
    21
endif
alpar@1381
    22
alpar@1378
    23
nobase_pkginclude_HEADERS = \
deba@1864
    24
	bellman_ford.h \
ladanyi@1349
    25
	bezier.h \
ladanyi@1349
    26
	bfs.h \
ladanyi@1349
    27
	dfs.h \
ladanyi@1349
    28
	bin_heap.h \
ladanyi@1433
    29
	config.h \
alpar@1847
    30
	counter.h \
ladanyi@1349
    31
	dijkstra.h \
ladanyi@1349
    32
	dimacs.h \
deba@1912
    33
	dag_shortest_path.h \
deba@1842
    34
	edge_set.h \
ladanyi@1349
    35
	error.h \
ladanyi@1349
    36
	fib_heap.h \
deba@1700
    37
	floyd_warshall.h \
deba@1912
    38
	fredman_tarjan.h \
ladanyi@1349
    39
	full_graph.h \
deba@1625
    40
	grid_graph.h \
alpar@1401
    41
	graph_adaptor.h \
ladanyi@1349
    42
	graph_utils.h \
ladanyi@1349
    43
	graph_to_eps.h \
deba@1693
    44
	hypercube_graph.h \
ladanyi@1349
    45
	invalid.h \
alpar@1677
    46
	iterable_maps.h \
deba@1700
    47
	johnson.h \
ladanyi@1349
    48
	kruskal.h \
deba@1724
    49
	linear_heap.h \
ladanyi@1349
    50
	list_graph.h \
alpar@1629
    51
	lp.h \
alpar@1378
    52
	lp_base.h \
alpar@1381
    53
	lp_cplex.h \
alpar@1378
    54
	lp_glpk.h \
alpar@1378
    55
	lp_skeleton.h \
ladanyi@1349
    56
	maps.h \
deba@1724
    57
	matrix_maps.h \
deba@1824
    58
	map_iterator.h \
ladanyi@1349
    59
	max_matching.h \
ladanyi@1349
    60
	min_cost_flow.h \
deba@1967
    61
	minimal_cut.h \
ladanyi@1349
    62
	suurballe.h \
ladanyi@1349
    63
	preflow.h \
ladanyi@1349
    64
	path.h \
deba@1912
    65
	prim.h \
ladanyi@1349
    66
	radix_heap.h \
deba@1833
    67
	radix_sort.h \
ladanyi@1923
    68
	simann.h \
ladanyi@1349
    69
	smart_graph.h \
deba@1866
    70
	sub_graph.h \
ladanyi@1349
    71
	time_measure.h \
deba@1700
    72
	topology.h \
deba@1724
    73
	traits.h \
ladanyi@1349
    74
	unionfind.h \
ladanyi@1349
    75
	xy.h \
ladanyi@1349
    76
	concept_check.h \
ladanyi@1349
    77
	utility.h \
deba@1408
    78
	lemon_reader.h \
deba@1409
    79
	lemon_writer.h \
ladanyi@1349
    80
	graph_reader.h \
ladanyi@1349
    81
	graph_writer.h \
alpar@1835
    82
	tolerance.h \
ladanyi@1349
    83
	bits/alteration_notifier.h \
ladanyi@1349
    84
	bits/array_map.h \
ladanyi@1349
    85
	bits/default_map.h \
ladanyi@1349
    86
	bits/vector_map.h \
ladanyi@1349
    87
	bits/iterable_graph_extender.h \
ladanyi@1349
    88
	bits/extendable_graph_extender.h \
ladanyi@1349
    89
	bits/clearable_graph_extender.h \
ladanyi@1349
    90
	bits/erasable_graph_extender.h \
klao@1795
    91
	bits/graph_extender.h \
alpar@1815
    92
	bits/map_extender.h \
deba@1707
    93
	bits/static_map.h \
deba@1409
    94
	bits/item_reader.h \
alpar@1488
    95
	bits/item_writer.h \
deba@1910
    96
	concept/bpugraph.h \
ladanyi@1349
    97
	concept/graph.h \
ladanyi@1349
    98
	concept/graph_component.h \
klao@1909
    99
	concept/ugraph.h \
deba@1724
   100
	concept/matrix_maps.h \
ladanyi@1349
   101
	concept/maps.h \
ladanyi@1349
   102
	concept/heap.h \
klao@959
   103
	concept/path.h