# # ChangeLog for src/lemon/concept/graph_component.h in lemon-0.x # # Generated by Trac 1.2.3 # 03/28/24 13:03:23 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 Thu, 11 Nov 2004 09:31:55 GMT Balazs Dezso [980:0f1044b7a3af] * src/lemon/Makefile.am (modified) * src/lemon/alteration_observer_registry.h (modified) * src/lemon/array_map.h (modified) * src/lemon/clearable_graph_extender.h (modified) * src/lemon/concept/graph_component.h (modified) * src/lemon/default_map.h (modified) * src/lemon/erasable_graph_extender.h (modified) * src/lemon/extendable_graph_extender.h (modified) * src/lemon/full_graph.h (modified) * src/lemon/idmappable_graph_extender.h (deleted) * src/lemon/list_graph.h (modified) * src/lemon/map_bits.h (deleted) * src/lemon/smart_graph.h (modified) * src/lemon/vector_map.h (modified) * src/test/graph_test.cc (modified) maxNodeId() and maxEdgeId() changed to maxId(Node) and maxId(Edge) ... Fri, 05 Nov 2004 07:26:20 GMT Alpar Juttner [964:2c0c20e90116] * src/lemon/concept/graph_component.h (modified) * src/lemon/dimacs.h (modified) * src/lemon/graph_utils.h (modified) * src/lemon/xy.h (modified) Doc improvements Fri, 05 Nov 2004 00:31:49 GMT Mihaly Barasz [962:1a770e9f80b2] * src/lemon/Makefile.am (modified) * src/lemon/alteration_observer_registry.h (modified) * src/lemon/concept/graph_component.h (modified) * src/lemon/concept/undir_graph.h (added) * src/lemon/iterable_graph_extender.h (modified) * src/lemon/undir_graph_extender.h (added) * src/test/Makefile.am (modified) * src/test/undir_graph_test.cc (added) Undirect graph implementation. Not yet done, untested. Thu, 04 Nov 2004 22:04:51 GMT Mihaly Barasz [961:289d80c33f04] * src/lemon/concept/graph.h (modified) * src/lemon/concept/graph_component.h (modified) * src/test/Makefile.am (modified) * src/test/new_graph_test.cc (deleted) * Somewhat less redundant and a bit more correct graph concepts. * ... Thu, 04 Nov 2004 20:24:59 GMT Mihaly Barasz [959:c80ef5912903] * doc/Doxyfile (modified) * doc/graphs.dox (modified) * doc/groups.dox (modified) * doc/namespaces.dox (modified) * src/lemon/Makefile.am (modified) * src/lemon/concept/graph.h (added) * src/lemon/concept/graph_component.h (added) * src/lemon/concept/maps.h (added) * src/lemon/concept/path.h (added) * src/lemon/concept/sym_graph.h (added) * src/lemon/dijkstra.h (modified) * src/lemon/full_graph.h (modified) * src/lemon/list_graph.h (modified) * src/lemon/maps.h (modified) * src/lemon/path.h (modified) * src/lemon/skeletons/graph.h (deleted) * src/lemon/skeletons/graph_component.h (deleted) * src/lemon/skeletons/maps.h (deleted) * src/lemon/skeletons/path.h (deleted) * src/lemon/skeletons/sym_graph.h (deleted) * src/lemon/smart_graph.h (modified) * src/test/bfs_test.cc (modified) * src/test/dfs_test.cc (modified) * src/test/dijkstra_test.cc (modified) * src/test/graph_factory_test.cc (modified) * src/test/graph_test.cc (modified) * src/test/graph_wrapper_test.cc (modified) * src/test/kruskal_test.cc (modified) * src/test/new_graph_test.cc (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/work/Doxyfile (modified) * src/work/alpar/dijkstra.h (modified) * src/work/alpar/list_graph_demo.cc (modified) * src/work/marci/bfs_mm_test.cc (modified) * src/work/peter/path/path.h (modified) * src/work/peter/path/path_skeleton.h (modified) * src/work/peter/path/path_test.cc (modified) skeleton(s) -> concept renaming