1.1 --- a/lemon/Makefile.am	Mon May 15 16:21:50 2006 +0000
     1.2 +++ b/lemon/Makefile.am	Tue May 16 16:59:57 2006 +0000
     1.3 @@ -28,49 +28,78 @@
     1.4  	bellman_ford.h \
     1.5  	bezier.h \
     1.6  	bfs.h \
     1.7 -	dfs.h \
     1.8  	bin_heap.h \
     1.9 +	bipartite_matching.h \
    1.10 +	bits/alteration_notifier.h \
    1.11 +	bits/array_map.h \
    1.12 +	bits/base_extender.h \
    1.13 +	bits/default_map.h \
    1.14 +	bits/edge_set_extender.h \
    1.15 +	bits/graph_adaptor_extender.h \
    1.16 +	bits/graph_extender.h \
    1.17 +	bits/invalid.h \
    1.18 +	bits/item_reader.h \
    1.19 +	bits/item_writer.h \
    1.20 +	bits/map_extender.h \
    1.21 +	bits/mingw32_rand.h \
    1.22 +	bits/mingw32_time.h \
    1.23 +	bits/traits.h \
    1.24 +	bits/utility.h \
    1.25 +	bits/vector_map.h \
    1.26  	bpugraph_adaptor.h \
    1.27 -	bipartite_matching.h \
    1.28  	bucket_heap.h \
    1.29  	color.h \
    1.30 +	concept_check.h \
    1.31 +	concept/bpugraph.h \
    1.32 +	concept/graph.h \
    1.33 +	concept/graph_component.h \
    1.34 +	concept/heap.h \
    1.35 +	concept/maps.h \
    1.36 +	concept/matrix_maps.h \
    1.37 +	concept/path.h
    1.38 +	concept/ugraph.h \
    1.39  	config.h \
    1.40  	counter.h \
    1.41 +	dag_shortest_path.h \
    1.42 +	dfs.h \
    1.43  	dijkstra.h \
    1.44  	dimacs.h \
    1.45 -	dag_shortest_path.h \
    1.46  	edge_set.h \
    1.47  	edmonds_karp.h \
    1.48 +	eps.h \
    1.49  	error.h \
    1.50 -	eps.h \
    1.51  	fib_heap.h \
    1.52  	floyd_warshall.h \
    1.53  	fredman_tarjan.h \
    1.54  	full_graph.h \
    1.55 +	graph_adaptor.h \
    1.56 +	graph_reader.h \
    1.57 +	graph_to_eps.h \
    1.58 +	graph_utils.h \
    1.59 +	graph_writer.h \
    1.60  	grid_ugraph.h \
    1.61 -	graph_adaptor.h \
    1.62 -	graph_utils.h \
    1.63 -	graph_to_eps.h \
    1.64  	hypercube_graph.h \
    1.65  	iterable_maps.h \
    1.66  	johnson.h \
    1.67  	kruskal.h \
    1.68 +	lemon_reader.h \
    1.69 +	lemon_writer.h \
    1.70  	list_graph.h \
    1.71  	lp.h \
    1.72  	lp_base.h \
    1.73  	lp_cplex.h \
    1.74  	lp_glpk.h \
    1.75  	lp_skeleton.h \
    1.76 +	map_iterator.h \
    1.77  	maps.h \
    1.78  	matrix_maps.h \
    1.79 -	map_iterator.h \
    1.80  	max_matching.h \
    1.81  	min_cost_arborescence.h \
    1.82  	min_cost_flow.h \
    1.83  	min_cut.h \
    1.84 -	suurballe.h \
    1.85 +	path.h \
    1.86 +	polynomial.h \
    1.87  	preflow.h \
    1.88 -	path.h \
    1.89  	prim.h \
    1.90  	radix_heap.h \
    1.91  	radix_sort.h \
    1.92 @@ -78,39 +107,11 @@
    1.93  	simann.h \
    1.94  	smart_graph.h \
    1.95  	sub_graph.h \
    1.96 +	suurballe.h \
    1.97  	tabu_search.h \
    1.98  	time_measure.h \
    1.99 +	tolerance.h \
   1.100  	topology.h \
   1.101  	ugraph_adaptor.h \
   1.102  	unionfind.h \
   1.103 -	xy.h \
   1.104 -	concept_check.h \
   1.105 -	lemon_reader.h \
   1.106 -	lemon_writer.h \
   1.107 -	graph_reader.h \
   1.108 -	graph_writer.h \
   1.109 -	tolerance.h \
   1.110 -	bits/alteration_notifier.h \
   1.111 -	bits/array_map.h \
   1.112 -	bits/base_extender.h \
   1.113 -	bits/default_map.h \
   1.114 -	bits/vector_map.h \
   1.115 -	bits/map_extender.h \
   1.116 -	bits/graph_extender.h \
   1.117 -	bits/graph_adaptor_extender.h \
   1.118 -	bits/edge_set_extender.h \
   1.119 -	bits/invalid.h \
   1.120 -	bits/item_reader.h \
   1.121 -	bits/item_writer.h \
   1.122 -	bits/traits.h \
   1.123 -	bits/utility.h \
   1.124 -	bits/mingw32_rand.h \
   1.125 -	bits/mingw32_time.h \
   1.126 -	concept/bpugraph.h \
   1.127 -	concept/graph.h \
   1.128 -	concept/graph_component.h \
   1.129 -	concept/ugraph.h \
   1.130 -	concept/matrix_maps.h \
   1.131 -	concept/maps.h \
   1.132 -	concept/heap.h \
   1.133 -	concept/path.h
   1.134 +	xy.h