lemon/Makefile.am
author deba
Wed, 06 Sep 2006 11:17:12 +0000
changeset 2205 c20b0eb92a33
parent 2183 b6602864e456
child 2207 75a29ac69c19
permissions -rw-r--r--
UnionFind
Changing the representation of the union-find
it has the same running time but it takes just 2/3 space
! does not auto insert items /performance/

UnionFindEnum
Changing the interface - more convenient to UnionFind
Does not based on the stl data structures /it could be disadvantage/
=> does not use singular iterator assignment /not stl conform, but always work/
Just new iterator interface

MaxMatching + UnionFindTest
Using new iterator interface instead of the old
ladanyi@2119
     1
EXTRA_DIST += \
ladanyi@2119
     2
	lemon/Makefile \
ladanyi@2119
     3
	lemon/lemon.pc.in
ladanyi@2118
     4
ladanyi@2108
     5
pkgconfig_DATA += lemon/lemon.pc
ladanyi@1304
     6
ladanyi@2108
     7
lib_LTLIBRARIES += lemon/libemon.la
ladanyi@1304
     8
ladanyi@2108
     9
lemon_libemon_la_SOURCES = \
ladanyi@2108
    10
	lemon/lp_base.cc \
ladanyi@2108
    11
	lemon/lp_skeleton.cc \
ladanyi@2108
    12
	lemon/base.cc \
alpar@2174
    13
	lemon/color.cc \
ladanyi@2108
    14
	lemon/eps.cc \
ladanyi@2108
    15
	lemon/bits/mingw32_rand.cc \
ladanyi@2108
    16
	lemon/bits/mingw32_time.cc
ladanyi@1349
    17
ladanyi@2108
    18
lemon_libemon_la_CXXFLAGS = $(GLPK_CFLAGS) $(CPLEX_CFLAGS)
ladanyi@2108
    19
lemon_libemon_la_LDFLAGS = $(GLPK_LIBS) $(CPLEX_LIBS)
ladanyi@1304
    20
ladanyi@1349
    21
if HAVE_GLPK
ladanyi@2108
    22
lemon_libemon_la_SOURCES += lemon/lp_glpk.cc
athos@2144
    23
lemon_libemon_la_SOURCES += lemon/mip_glpk.cc
ladanyi@1349
    24
endif
ladanyi@596
    25
alpar@1381
    26
if HAVE_CPLEX
ladanyi@2108
    27
lemon_libemon_la_SOURCES += lemon/lp_cplex.cc
alpar@1381
    28
endif
alpar@1381
    29
ladanyi@2108
    30
lemon_HEADERS += \
ladanyi@2108
    31
	lemon/bellman_ford.h \
ladanyi@2108
    32
	lemon/bfs.h \
ladanyi@2108
    33
	lemon/bin_heap.h \
ladanyi@2108
    34
	lemon/bipartite_matching.h \
ladanyi@2108
    35
	lemon/bpugraph_adaptor.h \
ladanyi@2108
    36
	lemon/bucket_heap.h \
ladanyi@2108
    37
	lemon/color.h \
ladanyi@2108
    38
	lemon/config.h \
alpar@2183
    39
	lemon/concept_check.h \
ladanyi@2108
    40
	lemon/counter.h \
ladanyi@2108
    41
	lemon/dag_shortest_path.h \
ladanyi@2108
    42
	lemon/dfs.h \
ladanyi@2108
    43
	lemon/dijkstra.h \
ladanyi@2108
    44
	lemon/dimacs.h \
ladanyi@2108
    45
	lemon/edge_set.h \
ladanyi@2108
    46
	lemon/edmonds_karp.h \
ladanyi@2108
    47
	lemon/eps.h \
ladanyi@2108
    48
	lemon/error.h \
ladanyi@2108
    49
	lemon/fib_heap.h \
ladanyi@2108
    50
	lemon/floyd_warshall.h \
ladanyi@2108
    51
	lemon/fredman_tarjan.h \
ladanyi@2108
    52
	lemon/full_graph.h \
ladanyi@2108
    53
	lemon/graph_adaptor.h \
ladanyi@2108
    54
	lemon/graph_reader.h \
ladanyi@2108
    55
	lemon/graph_to_eps.h \
ladanyi@2108
    56
	lemon/graph_utils.h \
ladanyi@2108
    57
	lemon/graph_writer.h \
ladanyi@2108
    58
	lemon/grid_ugraph.h \
ladanyi@2108
    59
	lemon/hypercube_graph.h \
ladanyi@2108
    60
	lemon/iterable_maps.h \
ladanyi@2108
    61
	lemon/johnson.h \
ladanyi@2108
    62
	lemon/kruskal.h \
ladanyi@2108
    63
	lemon/lemon_reader.h \
ladanyi@2108
    64
	lemon/lemon_writer.h \
ladanyi@2108
    65
	lemon/list_graph.h \
ladanyi@2108
    66
	lemon/lp.h \
ladanyi@2108
    67
	lemon/lp_base.h \
ladanyi@2108
    68
	lemon/lp_cplex.h \
ladanyi@2108
    69
	lemon/lp_glpk.h \
ladanyi@2108
    70
	lemon/lp_skeleton.h \
ladanyi@2108
    71
	lemon/map_iterator.h \
ladanyi@2108
    72
	lemon/maps.h \
ladanyi@2108
    73
	lemon/matrix_maps.h \
ladanyi@2108
    74
	lemon/max_matching.h \
ladanyi@2108
    75
	lemon/min_cost_arborescence.h \
ladanyi@2108
    76
	lemon/min_cost_flow.h \
ladanyi@2108
    77
	lemon/min_cut.h \
alpar@2183
    78
	lemon/mip_glpk.h \
ladanyi@2108
    79
	lemon/path.h \
ladanyi@2108
    80
	lemon/polynomial.h \
ladanyi@2108
    81
	lemon/preflow.h \
ladanyi@2108
    82
	lemon/prim.h \
ladanyi@2108
    83
	lemon/radix_heap.h \
ladanyi@2108
    84
	lemon/radix_sort.h \
ladanyi@2108
    85
	lemon/refptr.h \
ladanyi@2108
    86
	lemon/simann.h \
ladanyi@2108
    87
	lemon/smart_graph.h \
ladanyi@2108
    88
	lemon/sub_graph.h \
ladanyi@2108
    89
	lemon/suurballe.h \
ladanyi@2108
    90
	lemon/tabu_search.h \
ladanyi@2108
    91
	lemon/time_measure.h \
ladanyi@2108
    92
	lemon/tolerance.h \
ladanyi@2108
    93
	lemon/topology.h \
ladanyi@2108
    94
	lemon/ugraph_adaptor.h \
ladanyi@2108
    95
	lemon/unionfind.h \
ladanyi@2108
    96
	lemon/xy.h
ladanyi@2108
    97
ladanyi@2108
    98
bits_HEADERS += \
ladanyi@2108
    99
	lemon/bits/alteration_notifier.h \
ladanyi@2108
   100
	lemon/bits/array_map.h \
ladanyi@2108
   101
	lemon/bits/base_extender.h \
alpar@2183
   102
	lemon/bits/bezier.h \
deba@2202
   103
	lemon/bits/debug_map.h \
ladanyi@2108
   104
	lemon/bits/default_map.h \
ladanyi@2108
   105
	lemon/bits/edge_set_extender.h \
ladanyi@2108
   106
	lemon/bits/graph_adaptor_extender.h \
ladanyi@2108
   107
	lemon/bits/graph_extender.h \
ladanyi@2108
   108
	lemon/bits/invalid.h \
ladanyi@2108
   109
	lemon/bits/item_reader.h \
ladanyi@2108
   110
	lemon/bits/item_writer.h \
ladanyi@2108
   111
	lemon/bits/map_extender.h \
ladanyi@2108
   112
	lemon/bits/mingw32_rand.h \
ladanyi@2108
   113
	lemon/bits/mingw32_time.h \
ladanyi@2108
   114
	lemon/bits/traits.h \
ladanyi@2108
   115
	lemon/bits/utility.h \
deba@2177
   116
	lemon/bits/variant.h \
ladanyi@2108
   117
	lemon/bits/vector_map.h
ladanyi@2108
   118
ladanyi@2108
   119
concept_HEADERS += \
ladanyi@2108
   120
	lemon/concept_check.h \
ladanyi@2108
   121
	lemon/concept/bpugraph.h \
ladanyi@2108
   122
	lemon/concept/graph.h \
deba@2126
   123
	lemon/concept/graph_components.h \
ladanyi@2108
   124
	lemon/concept/heap.h \
ladanyi@2108
   125
	lemon/concept/maps.h \
ladanyi@2108
   126
	lemon/concept/matrix_maps.h \
ladanyi@2108
   127
	lemon/concept/path.h \
ladanyi@2108
   128
	lemon/concept/ugraph.h