#
# ChangeLog for src/work/athos/old in lemon-0.x
#
# Generated by Trac 1.2.3
# 09/20/21 04:04:00
Sat, 13 Nov 2004 17:07:10 GMT Alpar Juttner [987:87f7c54892df]
* ChangeLog (modified)
* doc/maps.dox (modified)
* src/lemon/array_map.h (modified)
* src/lemon/concept/graph.h (modified)
* src/lemon/concept/graph_component.h (modified)
* src/lemon/concept/maps.h (modified)
* src/lemon/default_map.h (modified)
* src/lemon/dijkstra.h (modified)
* src/lemon/dimacs.h (modified)
* src/lemon/graph_wrapper.h (modified)
* src/lemon/kruskal.h (modified)
* src/lemon/map_defines.h (modified)
* src/lemon/map_iterator.h (modified)
* src/lemon/maps.h (modified)
* src/lemon/min_cost_flow.h (modified)
* src/lemon/suurballe.h (modified)
* src/lemon/vector_map.h (modified)
* src/lemon/xy.h (modified)
* src/test/sym_graph_test.h (modified)
* src/work/alpar/boolmap_iter.cc (modified)
* src/work/alpar/dijkstra.h (modified)
* src/work/alpar/f_ed_ka.h (modified)
* src/work/alpar/rw_nonref_map.cc (modified)
* src/work/athos/mincostflow.h (modified)
* src/work/athos/old/minlengthpaths.h (modified)
* src/work/athos/union_find.h (modified)
* src/work/deba/dijkstra.h (modified)
* src/work/klao/iter_map.h (modified)
* src/work/marci/augmenting_flow.h (modified)
* src/work/marci/bfs_mm.h (modified)
* src/work/marci/bipartite_graph_wrapper.h (modified)
* src/work/marci/experiment/list_graph.h (modified)
* src/work/marci/graph_concept.h (modified)
* src/work/marci/leda/leda_graph_wrapper.h (modified)
* src/work/peter/edgepathgraph.h (modified)
* src/work/peter/hierarchygraph.h (modified)
* src/work/sage_graph.h (modified)
Naming changes:
- ValueType -> Value
- KeyType -> Key
- ...
Sat, 13 Nov 2004 12:53:28 GMT Alpar Juttner [986:e997802b855c]
* doc/graphs.dox (modified)
* doc/maps.dox (modified)
* src/benchmark/bfs-bench.cc (modified)
* src/demo/dim_to_dot.cc (modified)
* src/demo/sub_graph_wrapper_demo.cc (modified)
* src/demo/tight_edge_filter_map.h (modified)
* src/lemon/bfs.h (modified)
* src/lemon/concept/graph.h (modified)
* src/lemon/concept/graph_component.h (modified)
* src/lemon/concept/path.h (modified)
* src/lemon/concept/sym_graph.h (modified)
* src/lemon/concept/undir_graph.h (modified)
* src/lemon/concept_check.h (modified)
* src/lemon/dfs.h (modified)
* src/lemon/dijkstra.h (modified)
* src/lemon/dimacs.h (modified)
* src/lemon/full_graph.h (modified)
* src/lemon/graph_utils.h (modified)
* src/lemon/graph_wrapper.h (modified)
* src/lemon/kruskal.h (modified)
* src/lemon/list_graph.h (modified)
* src/lemon/min_cost_flow.h (modified)
* src/lemon/path.h (modified)
* src/lemon/preflow.h (modified)
* src/lemon/smart_graph.h (modified)
* src/lemon/suurballe.h (modified)
* src/lemon/undir_graph_extender.h (modified)
* src/test/bfs_test.cc (modified)
* src/test/dfs_test.cc (modified)
* src/test/dijkstra_heap_test.cc (modified)
* src/test/dijkstra_test.cc (modified)
* src/test/graph_factory_test.cc (modified)
* src/test/graph_test.h (modified)
* src/test/path_test.cc (modified)
* src/test/preflow_test.cc (modified)
* src/test/sym_graph_test.cc (modified)
* src/test/sym_graph_test.h (modified)
* src/test/test_tools.h (modified)
* src/work/alpar/bfs-named-param.cc (modified)
* src/work/alpar/boolmap_iter.cc (modified)
* src/work/alpar/dijkstra.h (modified)
* src/work/alpar/f_ed_ka.h (modified)
* src/work/alpar/f_ed_ka_demo.cc (modified)
* src/work/alpar/graph.h (modified)
* src/work/alpar/gwrapper.h (modified)
* src/work/alpar/list_graph_demo.cc (modified)
* src/work/alpar/rw_nonref_map.cc (modified)
* src/work/alpar/smart_graph_demo.cc (modified)
* src/work/athos/bfs_test.cc (modified)
* src/work/athos/dijkstra_demo.cc (modified)
* src/work/athos/mincostflow.h (modified)
* src/work/athos/old/minlengthpaths.h (modified)
* src/work/athos/preflow_push_wogw.h (modified)
* src/work/deba/list_graph.h (modified)
* src/work/jacint/max_flow.h (modified)
* src/work/jacint/max_flow_bug.cc (modified)
* src/work/jacint/max_flow_test.cc (modified)
* src/work/jacint/max_matching.cc (modified)
* src/work/jacint/max_matching.h (modified)
* src/work/jacint/max_save.h (modified)
* src/work/jacint/preflow.cc (modified)
* src/work/jacint/preflow_excess.h (modified)
* src/work/jacint/preflow_excess_test.cc (modified)
* src/work/jacint/preflow_res.h (modified)
* src/work/jacint/prim.h (modified)
* src/work/johanna/ma_order.h (modified)
* src/work/marci/augmenting_flow.h (modified)
* src/work/marci/bfs_dfs.h (modified)
* src/work/marci/bfs_mm.h (modified)
* src/work/marci/bfs_mm_test.cc (modified)
* src/work/marci/bfsit_vs_byhand.cc (modified)
* src/work/marci/bipartite_graph_wrapper.h (modified)
* src/work/marci/bipartite_graph_wrapper_test.cc (modified)
* src/work/marci/experiment/edmonds_karp.h (modified)
* src/work/marci/experiment/edmonds_karp_1.h (modified)
* src/work/marci/experiment/edmonds_karp_demo.cc (modified)
* src/work/marci/experiment/edmonds_karp_demo_1.cc (modified)
* src/work/marci/experiment/graph_wrapper.h (modified)
* src/work/marci/experiment/graph_wrapper_1.h (modified)
* src/work/marci/experiment/graph_wrapper_st_ostream_op.h (modified)
* src/work/marci/experiment/iterator_bfs_demo.cc (modified)
* src/work/marci/experiment/iterator_bfs_demo_1.cc (modified)
* src/work/marci/experiment/list_graph.h (modified)
* src/work/marci/graph_concept.h (modified)
* src/work/marci/iterator_bfs_demo.cc (modified)
* src/work/marci/leda/bipartite_matching_comparison.cc (modified)
* src/work/marci/leda/leda_graph_wrapper.h (modified)
* src/work/marci/leda/max_bipartite_matching_demo.cc (modified)
* src/work/marci/leda_bfs_dfs.cc (modified)
* src/work/marci/leda_graph_demo.cc (modified)
* src/work/marci/lp/max_flow_by_lp.cc (modified)
* src/work/marci/max_flow_demo.cc (modified)
* src/work/marci/oldies/edmonds_karp.h (modified)
* src/work/marci/oldies/marci_graph_demo.cc (modified)
* src/work/marci/preflow_bug.cc (modified)
* src/work/marci/preflow_demo_athos.cc (modified)
* src/work/marci/preflow_demo_jacint.cc (modified)
* src/work/peter/edgepathgraph.h (modified)
* src/work/peter/edgepathgraph_test.cc (modified)
* src/work/peter/hierarchygraph.h (modified)
* src/work/peter/path/path.h (modified)
* src/work/peter/path/path_skeleton.h (modified)
* src/work/peter/path/path_test.cc (modified)
* src/work/sage_graph.h (modified)
Naming changes:
- head -> target
- tail -> source
Wed, 29 Sep 2004 15:30:04 GMT Alpar Juttner [921:818510fa3d99]
* Makefile.am (modified)
* configure.ac (modified)
* doc/coding_style.dox (modified)
* doc/graphs.dox (modified)
* doc/groups.dox (modified)
* doc/mainpage.dox (modified)
* doc/maps.dox (modified)
* doc/namespaces.dox (modified)
* src/Makefile.am (modified)
* src/benchmark/bench_tools.h (modified)
* src/benchmark/bfs-bench.cc (modified)
* src/benchmark/graph-bench.cc (modified)
* src/benchmark/hcube.cc (modified)
* src/demo/sub_graph_wrapper_demo.cc (modified)
* src/lemon/Makefile.am (moved)
* src/lemon/array_map.h (moved)
* src/lemon/attic/debug.h (moved)
* src/lemon/attic/error.h (moved)
* src/lemon/attic/tight_edge_filter_map.h (moved)
* src/lemon/bfs.h (moved)
* src/lemon/bin_heap.h (moved)
* src/lemon/default_map.h (moved)
* src/lemon/dfs.h (moved)
* src/lemon/dijkstra.h (moved)
* src/lemon/dimacs.h (moved)
* src/lemon/extended_pair.h (moved)
* src/lemon/fib_heap.h (moved)
* src/lemon/full_graph.h (moved)
* src/lemon/graph_wrapper.h (moved)
* src/lemon/invalid.h (moved)
* src/lemon/kruskal.h (moved)
* src/lemon/list_graph.h (moved)
* src/lemon/map_bits.h (moved)
* src/lemon/map_defines.h (moved)
* src/lemon/map_iterator.h (moved)
* src/lemon/map_registry.h (moved)
* src/lemon/maps.h (moved)
* src/lemon/min_cost_flow.h (moved)
* src/lemon/path.h (moved)
* src/lemon/preflow.h (moved)
* src/lemon/skeletons/graph.h (moved)
* src/lemon/skeletons/maps.h (moved)
* src/lemon/skeletons/path.h (moved)
* src/lemon/smart_graph.h (moved)
* src/lemon/suurballe.h (moved)
* src/lemon/sym_map.h (moved)
* src/lemon/template.h (moved)
* src/lemon/tight_edge_filter_map.h (added)
* src/lemon/time_measure.h (moved)
* src/lemon/unionfind.h (moved)
* src/lemon/vector_map.h (moved)
* src/lemon/xy.h (moved)
* src/test/bfs_test.cc (modified)
* src/test/dfs_test.cc (modified)
* src/test/dijkstra_heap_test.cc (modified)
* src/test/dijkstra_test.cc (modified)
* src/test/error_test.cc (modified)
* src/test/graph_test.cc (modified)
* src/test/graph_test.h (modified)
* src/test/graph_wrapper_test.cc (modified)
* src/test/kruskal_test.cc (modified)
* src/test/min_cost_flow_test.cc (modified)
* src/test/path_test.cc (modified)
* src/test/preflow_test.cc (modified)
* src/test/suurballe_test.cc (modified)
* src/test/test_tools.h (modified)
* src/test/test_tools_fail.cc (modified)
* src/test/test_tools_pass.cc (modified)
* src/test/time_measure_test.cc (modified)
* src/test/unionfind_test.cc (modified)
* src/test/xy_test.cc (modified)
* src/work/akos/loader_demo.cc (modified)
* src/work/alpar/bfs-named-param.cc (modified)
* src/work/alpar/boolmap_iter.cc (modified)
* src/work/alpar/f_ed_ka.h (modified)
* src/work/alpar/f_ed_ka_demo.cc (modified)
* src/work/alpar/gwrapper.h (modified)
* src/work/alpar/list_graph_demo.cc (modified)
* src/work/alpar/rw_nonref_map.cc (modified)
* src/work/alpar/smart_graph_demo.cc (modified)
* src/work/athos/bfs_test.cc (modified)
* src/work/athos/dijkstra_at.h (modified)
* src/work/athos/dijkstra_demo.cc (modified)
* src/work/athos/kruskal.h (modified)
* src/work/athos/min_cost_flow.cc (modified)
* src/work/athos/mincostflow.h (modified)
* src/work/athos/minlength_demo.cc (modified)
* src/work/athos/old/minlengthpaths.h (modified)
* src/work/athos/pf_demo.cc (modified)
* src/work/athos/preflow_push_wogw.h (modified)
* src/work/athos/suurballe.cc (modified)
* src/work/athos/uf_demo.cc (modified)
* src/work/athos/union_find.h (modified)
* src/work/athos/xy/boundingbox.cc (modified)
* src/work/athos/xy/xy.cc (modified)
* src/work/bin_heap_demo.cc (modified)
* src/work/deba/array_map_factory.h (modified)
* src/work/deba/bin_heap.h (modified)
* src/work/deba/dijkstra.h (modified)
* src/work/deba/invalid.h (modified)
* src/work/deba/list_graph.h (modified)
* src/work/deba/map_registry.h (modified)
* src/work/deba/pac_map_factory.h (modified)
* src/work/deba/vector_map_factory.h (modified)
* src/work/iterator_bfs_dfs_demo.cc (modified)
* src/work/jacint/graph_gen.h (modified)
* src/work/jacint/ledacomp.cc (modified)
* src/work/jacint/max_flow.h (modified)
* src/work/jacint/max_flow_bug.cc (modified)
* src/work/jacint/max_flow_test.cc (modified)
* src/work/jacint/max_matching.cc (modified)
* src/work/jacint/max_matching.h (modified)
* src/work/jacint/max_save.h (modified)
* src/work/jacint/preflow.cc (modified)
* src/work/jacint/preflow_excess.h (modified)
* src/work/jacint/preflow_excess_test.cc (modified)
* src/work/jacint/preflow_res.h (modified)
* src/work/jacint/prim.cc (modified)
* src/work/jacint/prim.h (modified)
* src/work/johanna/contract_wrapper.h (modified)
* src/work/johanna/ma_order.h (modified)
* src/work/johanna/ma_order_test.cc (modified)
* src/work/klao/debug.h (modified)
* src/work/klao/iter_map.h (modified)
* src/work/klao/iter_map_test.cc (modified)
* src/work/klao/map_test.cc (modified)
* src/work/marci/augmenting_flow.h (modified)
* src/work/marci/bfs_dfs.h (modified)
* src/work/marci/bfs_dfs_misc.h (modified)
* src/work/marci/bfsit_vs_byhand.cc (modified)
* src/work/marci/bipartite_graph_wrapper.h (modified)
* src/work/marci/bipartite_graph_wrapper_test.cc (modified)
* src/work/marci/bipartite_matching_demo.cc (modified)
* src/work/marci/const_map_time.cc (modified)
* src/work/marci/experiment/bfs_iterator.h (modified)
* src/work/marci/experiment/bfs_iterator_1.h (modified)
* src/work/marci/experiment/edmonds_karp.h (modified)
* src/work/marci/experiment/edmonds_karp_1.h (modified)
* src/work/marci/experiment/edmonds_karp_demo.cc (modified)
* src/work/marci/experiment/edmonds_karp_demo_1.cc (modified)
* src/work/marci/experiment/graph_wrapper.h (modified)
* src/work/marci/experiment/graph_wrapper_1.h (modified)
* src/work/marci/experiment/graph_wrapper_st_ostream_op.h (modified)
* src/work/marci/experiment/iterator_bfs_demo.cc (modified)
* src/work/marci/experiment/iterator_bfs_demo_1.cc (modified)
* src/work/marci/experiment/list_graph.h (modified)
* src/work/marci/for_each_macros.h (modified)
* src/work/marci/graph_concept.h (modified)
* src/work/marci/graph_wrapper_time.cc (modified)
* src/work/marci/gw_vs_not.cc (modified)
* src/work/marci/iterator_bfs_demo.cc (modified)
* src/work/marci/leda/bipartite_matching_comparison.cc (modified)
* src/work/marci/leda/bipartite_matching_leda.cc (modified)
* src/work/marci/leda/bipartite_matching_leda_gen.cc (modified)
* src/work/marci/leda/leda_graph_wrapper.h (modified)
* src/work/marci/leda/max_bipartite_matching_demo.cc (modified)
* src/work/marci/leda_bfs_dfs.cc (modified)
* src/work/marci/leda_graph_demo.cc (modified)
* src/work/marci/lg_vs_sg_vs_sg.cc (modified)
* src/work/marci/lp/lp_solver_wrapper.h (modified)
* src/work/marci/lp/max_flow_by_lp.cc (modified)
* src/work/marci/macro_test.cc (modified)
* src/work/marci/max_bipartite_matching.h (modified)
* src/work/marci/max_flow_1.cc (modified)
* src/work/marci/max_flow_demo.cc (modified)
* src/work/marci/merge_node_graph_wrapper.h (modified)
* src/work/marci/merge_node_graph_wrapper_test.cc (modified)
* src/work/marci/oldies/edmonds_karp.h (modified)
* src/work/marci/oldies/marci_graph_demo.cc (modified)
* src/work/marci/preflow_bug.cc (modified)
* src/work/marci/preflow_demo_athos.cc (modified)
* src/work/marci/preflow_demo_jacint.cc (modified)
* src/work/marci/top_sort_test.cc (modified)
* src/work/peter/edgepathgraph.h (modified)
* src/work/peter/edgepathgraph_test.cc (modified)
* src/work/peter/hierarchygraph.h (modified)
* src/work/peter/hierarchygraph_test.cc (modified)
* src/work/peter/path/debug.h (modified)
* src/work/peter/path/path.h (modified)
* src/work/peter/path/path_skeleton.h (modified)
* src/work/peter/path/path_test.cc (modified)
* src/work/sage_graph.h (modified)
hugo -> lemon
Tue, 11 May 2004 15:42:11 GMT athos [607:327f7cf13843]
* src/work/athos/makefile (modified)
* src/work/athos/mincostflows.h (modified)
* src/work/athos/minlength_demo.cc (modified)
* src/work/athos/minlengthpaths.h (modified)
* src/work/athos/minlengthpaths_test.cc (modified)
* src/work/athos/old/minlengthpaths.h (modified)
* src/work/klao/path.h (modified)
Finished MinLengthPaths: a specialization of MinCostFlows.
Mon, 10 May 2004 16:52:51 GMT athos [601:6c6c0eb89b47]
* src/work/athos/old/minlengthpaths.h (added)
That's what I wanted.