Changeset 2086:3fc072264f77 in lemon-0.x

Timestamp:

05/16/06 18:59:57 (18 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2753

Message:

Polinomial template class

Files:

• lemon/Makefile.am (modified) (3 diffs)
• lemon/polynomial.h (added)
• test/Makefile.am (modified) (3 diffs)
• test/polynomial_test.cc (added)

lemon/Makefile.am

@@ -29 +29 @@
         bezier.h \
         bfs.h \
-        dfs.h \
         bin_heap.h \
+        bipartite_matching.h \
+        bits/alteration_notifier.h \
+        bits/array_map.h \
+        bits/base_extender.h \
+        bits/default_map.h \
+        bits/edge_set_extender.h \
+        bits/graph_adaptor_extender.h \
+        bits/graph_extender.h \
+        bits/invalid.h \
+        bits/item_reader.h \
+        bits/item_writer.h \
+        bits/map_extender.h \
+        bits/mingw32_rand.h \
+        bits/mingw32_time.h \
+        bits/traits.h \
+        bits/utility.h \
+        bits/vector_map.h \
         bpugraph_adaptor.h \
-        bipartite_matching.h \
         bucket_heap.h \
         color.h \
+        concept_check.h \
+        concept/bpugraph.h \
+        concept/graph.h \
+        concept/graph_component.h \
+        concept/heap.h \
+        concept/maps.h \
+        concept/matrix_maps.h \
+        concept/path.h
+        concept/ugraph.h \
         config.h \
         counter.h \
+        dag_shortest_path.h \
+        dfs.h \
         dijkstra.h \
         dimacs.h \
-        dag_shortest_path.h \
         edge_set.h \
         edmonds_karp.h \
+        eps.h \
         error.h \
-        eps.h \
         fib_heap.h \
         floyd_warshall.h \
         fredman_tarjan.h \
         full_graph.h \
+        graph_adaptor.h \
+        graph_reader.h \
+        graph_to_eps.h \
+        graph_utils.h \
+        graph_writer.h \
         grid_ugraph.h \
-        graph_adaptor.h \
-        graph_utils.h \
-        graph_to_eps.h \
         hypercube_graph.h \
         iterable_maps.h \
         johnson.h \
         kruskal.h \
+        lemon_reader.h \
+        lemon_writer.h \
         list_graph.h \
         lp.h \
@@ -62 +91 @@
         lp_glpk.h \
         lp_skeleton.h \
+        map_iterator.h \
         maps.h \
         matrix_maps.h \
-        map_iterator.h \
         max_matching.h \
         min_cost_arborescence.h \
         min_cost_flow.h \
         min_cut.h \
-        suurballe.h \
+        path.h \
+        polynomial.h \
         preflow.h \
-        path.h \
         prim.h \
         radix_heap.h \
@@ -79 +108 @@
         smart_graph.h \
         sub_graph.h \
+        suurballe.h \
         tabu_search.h \
         time_measure.h \
+        tolerance.h \
         topology.h \
         ugraph_adaptor.h \
         unionfind.h \
-        xy.h \
-        concept_check.h \
-        lemon_reader.h \
-        lemon_writer.h \
-        graph_reader.h \
-        graph_writer.h \
-        tolerance.h \
-        bits/alteration_notifier.h \
-        bits/array_map.h \
-        bits/base_extender.h \
-        bits/default_map.h \
-        bits/vector_map.h \
-        bits/map_extender.h \
-        bits/graph_extender.h \
-        bits/graph_adaptor_extender.h \
-        bits/edge_set_extender.h \
-        bits/invalid.h \
-        bits/item_reader.h \
-        bits/item_writer.h \
-        bits/traits.h \
-        bits/utility.h \
-        bits/mingw32_rand.h \
-        bits/mingw32_time.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
+        xy.h

test/Makefile.am

@@ -21 +21 @@
         dijkstra_test \
         edge_set_test \
+        graph_adaptor_test \
         graph_test \
-        graph_adaptor_test \
         graph_utils_test \
+        heap_test \
         kruskal_test \
         maps_test \
@@ -29 +30 @@
         max_matching_test \
         min_cost_flow_test \
-        suurballe_test \
         path_test \
+        polynomial_test \
         preflow_test \
         radix_sort_test \
         refptr_test \
+        simann_test \
+        suurballe_test \
         test_tools_fail \
         test_tools_pass \
         time_measure_test \
+        ugraph_test \
         unionfind_test \
-        ugraph_test \
-        xy_test \
-        heap_test \
-        simann_test
+        xy_test
 
 if HAVE_GLPK
@@ -62 +63 @@
 dijkstra_test_SOURCES = dijkstra_test.cc
 edge_set_test_SOURCES = edge_set_test.cc
+graph_adaptor_test_SOURCES = graph_adaptor_test.cc
 graph_test_SOURCES = graph_test.cc
 graph_utils_test_SOURCES = graph_utils_test.cc
-graph_adaptor_test_SOURCES = graph_adaptor_test.cc
+heap_test_SOURCES = heap_test.cc
 kruskal_test_SOURCES = kruskal_test.cc
 maps_test_SOURCES = maps_test.cc
 matrix_maps_test_SOURCES = matrix_maps_test.cc
+max_matching_test_SOURCES = max_matching_test.cc
 min_cost_flow_test_SOURCES = min_cost_flow_test.cc
-max_matching_test_SOURCES = max_matching_test.cc
-suurballe_test_SOURCES = suurballe_test.cc
 path_test_SOURCES = path_test.cc
+polynomial_test_SOURCES = polynomial_test.cc
+preflow_test_SOURCES = preflow_test.cc
 radix_sort_test_SOURCES = radix_sort_test.cc
 refptr_test_SOURCES = refptr_test.cc
-preflow_test_SOURCES = preflow_test.cc
-time_measure_test_SOURCES = time_measure_test.cc
+simann_test_SOURCES = simann_test.cc
+suurballe_test_SOURCES = suurballe_test.cc
 test_tools_fail_SOURCES = test_tools_fail.cc
 test_tools_pass_SOURCES = test_tools_pass.cc
+time_measure_test_SOURCES = time_measure_test.cc
+ugraph_test_SOURCES = ugraph_test.cc
 unionfind_test_SOURCES = unionfind_test.cc
 xy_test_SOURCES = xy_test.cc
-ugraph_test_SOURCES = ugraph_test.cc
-heap_test_SOURCES = heap_test.cc
-simann_test_SOURCES = simann_test.cc
 
 lp_test_SOURCES = lp_test.cc