#
# ChangeLog for lemon/min_cost_arborescence.h in lemon-0.x
#
# Generated by Trac 1.2.3
# 09/16/19 00:09:00
Tue, 24 Oct 2006 17:19:16 GMT Alpar Juttner [2260:4274224f8a7d]
* Makefile.am (modified)
* doc/graphs.dox (modified)
* doc/groups.dox (modified)
* doc/maps.dox (modified)
* doc/namespaces.dox (modified)
* lemon/Makefile.am (modified)
* lemon/bellman_ford.h (modified)
* lemon/bfs.h (modified)
* lemon/bits/array_map.h (modified)
* lemon/bits/base_extender.h (modified)
* lemon/bits/debug_map.h (modified)
* lemon/bits/graph_extender.h (modified)
* lemon/bits/map_extender.h (modified)
* lemon/bits/vector_map.h (modified)
* lemon/color.h (modified)
* lemon/concept/bpugraph.h (deleted)
* lemon/concept/graph.h (deleted)
* lemon/concept/graph_components.h (deleted)
* lemon/concept/heap.h (deleted)
* lemon/concept/maps.h (deleted)
* lemon/concept/matrix_maps.h (deleted)
* lemon/concept/path.h (deleted)
* lemon/concept/ugraph.h (deleted)
* lemon/concepts/bpugraph.h (added)
* lemon/concepts/graph.h (added)
* lemon/concepts/graph_components.h (added)
* lemon/concepts/heap.h (added)
* lemon/concepts/maps.h (added)
* lemon/concepts/matrix_maps.h (added)
* lemon/concepts/path.h (added)
* lemon/concepts/ugraph.h (added)
* lemon/dag_shortest_path.h (modified)
* lemon/dfs.h (modified)
* lemon/dijkstra.h (modified)
* lemon/edge_set.h (modified)
* lemon/floyd_warshall.h (modified)
* lemon/fredman_tarjan.h (modified)
* lemon/full_graph.h (modified)
* lemon/graph_adaptor.h (modified)
* lemon/grid_ugraph.h (modified)
* lemon/hypercube_graph.h (modified)
* lemon/johnson.h (modified)
* lemon/kruskal.h (modified)
* lemon/lemon_reader.h (modified)
* lemon/lemon_writer.h (modified)
* lemon/list_graph.h (modified)
* lemon/lp_base.h (modified)
* lemon/maps.h (modified)
* lemon/matrix_maps.h (modified)
* lemon/min_cost_arborescence.h (modified)
* lemon/min_cut.h (modified)
* lemon/prim.h (modified)
* lemon/smart_graph.h (modified)
* lemon/topology.h (modified)
* lemon/vmap.h (modified)
* test/bfs_test.cc (modified)
* test/bpugraph_test.cc (modified)
* test/dfs_test.cc (modified)
* test/dijkstra_test.cc (modified)
* test/edge_set_test.cc (modified)
* test/graph_adaptor_test.cc (modified)
* test/graph_factory_test.cc (modified)
* test/graph_test.cc (modified)
* test/heap_test.cc (modified)
* test/kruskal_test.cc (modified)
* test/maps_test.cc (modified)
* test/matrix_maps_test.cc (modified)
* test/path_test.cc (modified)
* test/preflow_test.cc (modified)
* test/test_tools.h (modified)
* test/ugraph_test.cc (modified)
concept -> concepts (namespace & directory)
Tue, 24 Oct 2006 16:49:41 GMT Alpar Juttner [2259:da142c310d02]
* lemon/kruskal.h (modified)
* lemon/min_cost_arborescence.h (modified)
Spellcheck
Tue, 18 Jul 2006 13:29:59 GMT Alpar Juttner [2151:38ec4a930c05]
* lemon/bellman_ford.h (modified)
* lemon/bfs.h (modified)
* lemon/bipartite_matching.h (modified)
* lemon/bits/utility.h (modified)
* lemon/dag_shortest_path.h (modified)
* lemon/dfs.h (modified)
* lemon/dijkstra.h (modified)
* lemon/edge_set.h (modified)
* lemon/edmonds_karp.h (modified)
* lemon/error.h (modified)
* lemon/floyd_warshall.h (modified)
* lemon/fredman_tarjan.h (modified)
* lemon/full_graph.h (modified)
* lemon/grid_ugraph.h (modified)
* lemon/johnson.h (modified)
* lemon/list_graph.h (modified)
* lemon/min_cost_arborescence.h (modified)
* lemon/min_cut.h (modified)
* lemon/preflow.h (modified)
* lemon/prim.h (modified)
* lemon/radix_heap.h (modified)
* lemon/refptr.h (modified)
* lemon/smart_graph.h (modified)
* lemon/tabu_search.h (modified)
exceptionName() has been thrown away
Wed, 28 Jun 2006 15:06:24 GMT Balazs Dezso [2111:ea1fa1bc3f6d]
* doc/graphs.dox (modified)
* lemon/bellman_ford.h (modified)
* lemon/concept/bpugraph.h (modified)
* lemon/concept/graph.h (modified)
* lemon/concept/graph_component.h (modified)
* lemon/concept/ugraph.h (modified)
* lemon/dag_shortest_path.h (modified)
* lemon/dijkstra.h (modified)
* lemon/edge_set.h (modified)
* lemon/floyd_warshall.h (modified)
* lemon/full_graph.h (modified)
* lemon/graph_adaptor.h (modified)
* lemon/hypercube_graph.h (modified)
* lemon/johnson.h (modified)
* lemon/kruskal.h (modified)
* lemon/list_graph.h (modified)
* lemon/min_cost_arborescence.h (modified)
* lemon/min_cut.h (modified)
* lemon/smart_graph.h (modified)
* lemon/topology.h (modified)
* test/bfs_test.cc (modified)
* test/dfs_test.cc (modified)
* test/dijkstra_test.cc (modified)
* test/edge_set_test.cc (modified)
* test/graph_adaptor_test.cc (modified)
* test/graph_factory_test.cc (modified)
* test/graph_test.cc (modified)
* test/kruskal_test.cc (modified)
* test/preflow_test.cc (modified)
* test/ugraph_test.cc (modified)
Removing concepts for extendable and erasable graphs
Renaming ...
Fri, 07 Apr 2006 09:54:35 GMT Balazs Dezso [2042:bdc953f2a449]
* demo/tight_edge_filter_map.h (modified)
* doc/groups.dox (modified)
* lemon/bellman_ford.h (modified)
* lemon/bucket_heap.h (modified)
* lemon/floyd_warshall.h (modified)
* lemon/fredman_tarjan.h (modified)
* lemon/graph_adaptor.h (modified)
* lemon/johnson.h (modified)
* lemon/max_matching.h (modified)
* lemon/min_cost_arborescence.h (modified)
* lemon/min_cut.h (modified)
* lemon/prim.h (modified)
* lemon/radix_sort.h (modified)
* lemon/ugraph_adaptor.h (modified)
New Algorithm group for matchings
LaTeX formulas
Bug fix => ///\f$ ...
Tue, 04 Apr 2006 17:43:23 GMT Balazs Dezso [2037:32e4bebee616]
* lemon/edmonds_karp.h (modified)
* lemon/graph_adaptor.h (modified)
* lemon/graph_reader.h (modified)
* lemon/graph_writer.h (modified)
* lemon/grid_ugraph.h (modified)
* lemon/min_cost_arborescence.h (modified)
* lemon/min_cut.h (modified)
* lemon/ugraph_adaptor.h (modified)
Doxygen log corrections
doc of ResGraphAdaptor has a bug in ...
Fri, 31 Mar 2006 11:10:44 GMT Balazs Dezso [2025:93fcadf94ab0]
* lemon/min_cost_arborescence.h (modified)
* test/Makefile.am (modified)
* test/arborescence_test.cc (added)
Bugfix in the minimum cost arborescence algorithm
Dual solution ...
Mon, 27 Mar 2006 08:12:01 GMT Balazs Dezso [2017:6064fd33807c]
* lemon/Makefile.am (modified)
* lemon/min_cost_arborescence.h (added)
Minimum Cost Arborescence algorithm