#
# ChangeLog for lemon/full_graph.h in lemon
#
# Generated by Trac 1.2.3
# 10/21/19 16:49:15
Fri, 09 Aug 2013 09:28:17 GMT Alpar Juttner [1270:dceba191c00d]
* doc/coding_style.dox (modified)
* doc/dirs.dox (modified)
* doc/groups.dox (modified)
* doc/lgf.dox (modified)
* doc/min_cost_flow.dox (modified)
* lemon/adaptors.h (modified)
* lemon/assert.h (modified)
* lemon/base.cc (modified)
* lemon/bellman_ford.h (modified)
* lemon/bfs.h (modified)
* lemon/bin_heap.h (modified)
* lemon/bits/alteration_notifier.h (modified)
* lemon/bits/array_map.h (modified)
* lemon/bits/bezier.h (modified)
* lemon/bits/default_map.h (modified)
* lemon/bits/edge_set_extender.h (modified)
* lemon/bits/graph_adaptor_extender.h (modified)
* lemon/bits/graph_extender.h (modified)
* lemon/bits/lock.h (modified)
* lemon/bits/map_extender.h (modified)
* lemon/bits/path_dump.h (modified)
* lemon/bits/solver_bits.h (modified)
* lemon/bits/traits.h (modified)
* lemon/bits/windows.cc (modified)
* lemon/bits/windows.h (modified)
* lemon/capacity_scaling.h (modified)
* lemon/cbc.cc (modified)
* lemon/cbc.h (modified)
* lemon/christofides_tsp.h (modified)
* lemon/circulation.h (modified)
* lemon/clp.cc (modified)
* lemon/clp.h (modified)
* lemon/concept_check.h (modified)
* lemon/concepts/bpgraph.h (modified)
* lemon/concepts/digraph.h (modified)
* lemon/concepts/graph.h (modified)
* lemon/concepts/graph_components.h (modified)
* lemon/concepts/heap.h (modified)
* lemon/concepts/maps.h (modified)
* lemon/concepts/path.h (modified)
* lemon/connectivity.h (modified)
* lemon/core.h (modified)
* lemon/cost_scaling.h (modified)
* lemon/cplex.cc (modified)
* lemon/cplex.h (modified)
* lemon/cycle_canceling.h (modified)
* lemon/dfs.h (modified)
* lemon/dijkstra.h (modified)
* lemon/dimacs.h (modified)
* lemon/edge_set.h (modified)
* lemon/edmonds_karp.h (modified)
* lemon/euler.h (modified)
* lemon/fractional_matching.h (modified)
* lemon/full_graph.h (modified)
* lemon/glpk.cc (modified)
* lemon/glpk.h (modified)
* lemon/gomory_hu.h (modified)
* lemon/graph_to_eps.h (modified)
* lemon/greedy_tsp.h (modified)
* lemon/grosso_locatelli_pullan_mc.h (modified)
* lemon/hao_orlin.h (modified)
* lemon/hartmann_orlin_mmc.h (modified)
* lemon/howard_mmc.h (modified)
* lemon/insertion_tsp.h (modified)
* lemon/karp_mmc.h (modified)
* lemon/kruskal.h (modified)
* lemon/lgf_reader.h (modified)
* lemon/lgf_writer.h (modified)
* lemon/list_graph.h (modified)
* lemon/lp.h (modified)
* lemon/lp_base.cc (modified)
* lemon/lp_base.h (modified)
* lemon/lp_skeleton.cc (modified)
* lemon/lp_skeleton.h (modified)
* lemon/maps.h (modified)
* lemon/matching.h (modified)
* lemon/math.h (modified)
* lemon/max_cardinality_search.h (modified)
* lemon/min_cost_arborescence.h (modified)
* lemon/nagamochi_ibaraki.h (modified)
* lemon/nearest_neighbor_tsp.h (modified)
* lemon/network_simplex.h (modified)
* lemon/opt2_tsp.h (modified)
* lemon/path.h (modified)
* lemon/planarity.h (modified)
* lemon/preflow.h (modified)
* lemon/radix_sort.h (modified)
* lemon/smart_graph.h (modified)
* lemon/soplex.cc (modified)
* lemon/soplex.h (modified)
* lemon/suurballe.h (modified)
* lemon/time_measure.h (modified)
* lemon/unionfind.h (modified)
* test/adaptors_test.cc (modified)
* test/arc_look_up_test.cc (modified)
* test/bellman_ford_test.cc (modified)
* test/bfs_test.cc (modified)
* test/bpgraph_test.cc (modified)
* test/circulation_test.cc (modified)
* test/connectivity_test.cc (modified)
* test/dfs_test.cc (modified)
* test/digraph_test.cc (modified)
* test/dijkstra_test.cc (modified)
* test/edge_set_test.cc (modified)
* test/euler_test.cc (modified)
* test/fractional_matching_test.cc (modified)
* test/gomory_hu_test.cc (modified)
* test/graph_copy_test.cc (modified)
* test/graph_test.cc (modified)
* test/graph_test.h (modified)
* test/hao_orlin_test.cc (modified)
* test/heap_test.cc (modified)
* test/lgf_reader_writer_test.cc (modified)
* test/lgf_test.cc (modified)
* test/lp_test.cc (modified)
* test/maps_test.cc (modified)
* test/matching_test.cc (modified)
* test/max_cardinality_search_test.cc (modified)
* test/max_clique_test.cc (modified)
* test/max_flow_test.cc (modified)
* test/min_cost_arborescence_test.cc (modified)
* test/min_cost_flow_test.cc (modified)
* test/min_mean_cycle_test.cc (modified)
* test/nagamochi_ibaraki_test.cc (modified)
* test/path_test.cc (modified)
* test/radix_sort_test.cc (modified)
* test/suurballe_test.cc (modified)
* test/time_measure_test.cc (modified)
* test/tsp_test.cc (modified)
* tools/dimacs-solver.cc (modified)
Apply unify-sources.sh to the source tree
Thu, 01 Dec 2011 08:05:47 GMT Balazs Dezso [1193:c8fa41fcc4a7]
* lemon/bits/graph_extender.h (modified)
* lemon/concepts/bpgraph.h (modified)
* lemon/concepts/graph_components.h (modified)
* lemon/core.h (modified)
* lemon/full_graph.h (modified)
* lemon/list_graph.h (modified)
* lemon/smart_graph.h (modified)
* test/bpgraph_test.cc (modified)
* test/graph_copy_test.cc (modified)
* test/graph_test.h (modified)
Type safe red and blue node set (#69)
Thu, 25 Nov 2010 21:45:29 GMT Balazs Dezso [1192:b84e68af8248]
* doc/lgf.dox (modified)
* lemon/full_graph.h (modified)
* lemon/lgf_reader.h (modified)
* lemon/lgf_writer.h (modified)
LGF reader and writer for bipartite graphs (#69)
Sun, 14 Nov 2010 21:48:32 GMT Balazs Dezso [1188:5ef0ab7b61cd]
* lemon/bits/graph_extender.h (modified)
* lemon/core.h (modified)
* lemon/full_graph.h (modified)
* lemon/smart_graph.h (modified)
* test/bpgraph_test.cc (modified)
FullBpGraph implementation (#69)
Sat, 06 Mar 2010 14:35:12 GMT Alpar Juttner [956:141f9c0db4a3]
* demo/arg_parser_demo.cc (modified)
* doc/groups.dox (modified)
* doc/mainpage.dox (modified)
* doc/min_cost_flow.dox (modified)
* lemon/adaptors.h (modified)
* lemon/arg_parser.cc (modified)
* lemon/arg_parser.h (modified)
* lemon/bellman_ford.h (modified)
* lemon/bfs.h (modified)
* lemon/binomial_heap.h (modified)
* lemon/bits/array_map.h (modified)
* lemon/bits/default_map.h (modified)
* lemon/bits/edge_set_extender.h (modified)
* lemon/bits/solver_bits.h (modified)
* lemon/bits/windows.cc (modified)
* lemon/bucket_heap.h (modified)
* lemon/capacity_scaling.h (modified)
* lemon/cbc.h (modified)
* lemon/circulation.h (modified)
* lemon/clp.cc (modified)
* lemon/clp.h (modified)
* lemon/concepts/digraph.h (modified)
* lemon/concepts/graph.h (modified)
* lemon/concepts/graph_components.h (modified)
* lemon/concepts/heap.h (modified)
* lemon/connectivity.h (modified)
* lemon/core.h (modified)
* lemon/cost_scaling.h (modified)
* lemon/cplex.cc (modified)
* lemon/cycle_canceling.h (modified)
* lemon/dfs.h (modified)
* lemon/dijkstra.h (modified)
* lemon/dimacs.h (modified)
* lemon/edge_set.h (modified)
* lemon/euler.h (modified)
* lemon/fractional_matching.h (modified)
* lemon/full_graph.h (modified)
* lemon/glpk.cc (modified)
* lemon/glpk.h (modified)
* lemon/gomory_hu.h (modified)
* lemon/graph_to_eps.h (modified)
* lemon/hao_orlin.h (modified)
* lemon/hartmann_orlin_mmc.h (modified)
* lemon/howard_mmc.h (modified)
* lemon/karp_mmc.h (modified)
* lemon/lgf_reader.h (modified)
* lemon/lgf_writer.h (modified)
* lemon/list_graph.h (modified)
* lemon/lp.h (modified)
* lemon/lp_base.cc (modified)
* lemon/lp_base.h (modified)
* lemon/lp_skeleton.cc (modified)
* lemon/lp_skeleton.h (modified)
* lemon/maps.h (modified)
* lemon/matching.h (modified)
* lemon/math.h (modified)
* lemon/min_cost_arborescence.h (modified)
* lemon/network_simplex.h (modified)
* lemon/path.h (modified)
* lemon/planarity.h (modified)
* lemon/preflow.h (modified)
* lemon/smart_graph.h (modified)
* lemon/soplex.cc (modified)
* lemon/soplex.h (modified)
* lemon/static_graph.h (modified)
* lemon/suurballe.h (modified)
* lemon/unionfind.h (modified)
* test/bellman_ford_test.cc (modified)
* test/bfs_test.cc (modified)
* test/circulation_test.cc (modified)
* test/connectivity_test.cc (modified)
* test/dfs_test.cc (modified)
* test/digraph_test.cc (modified)
* test/dijkstra_test.cc (modified)
* test/edge_set_test.cc (modified)
* test/euler_test.cc (modified)
* test/fractional_matching_test.cc (modified)
* test/gomory_hu_test.cc (modified)
* test/graph_test.cc (modified)
* test/hao_orlin_test.cc (modified)
* test/maps_test.cc (modified)
* test/matching_test.cc (modified)
* test/min_cost_arborescence_test.cc (modified)
* test/min_cost_flow_test.cc (modified)
* test/min_mean_cycle_test.cc (modified)
* test/preflow_test.cc (modified)
* test/suurballe_test.cc (modified)
* test/test_tools.h (modified)
* tools/dimacs-solver.cc (modified)
Unify the sources (#339)
Sun, 15 Nov 2009 18:57:02 GMT Peter Kovacs [834:c2230649a493]
* lemon/adaptors.h (modified)
* lemon/bfs.h (modified)
* lemon/dfs.h (modified)
* lemon/dijkstra.h (modified)
* lemon/edge_set.h (modified)
* lemon/full_graph.h (modified)
* lemon/grid_graph.h (modified)
* lemon/hypercube_graph.h (modified)
* lemon/list_graph.h (modified)
* lemon/smart_graph.h (modified)
* lemon/static_graph.h (modified)
Various doc improvements (#331)
- Add notes to the graph classes ...
Thu, 05 Nov 2009 09:23:16 GMT Alpar Juttner [827:580af8cf2f6a]
* lemon/Makefile.am (modified)
* lemon/Makefile.am (modified)
* lemon/full_graph.h (modified)
* lemon/full_graph.h (modified)
* lemon/hypercube_graph.h (modified)
* lemon/hypercube_graph.h (modified)
* lemon/smart_graph.h (modified)
* lemon/smart_graph.h (modified)
* test/digraph_test.cc (modified)
* test/digraph_test.cc (modified)
Merge #68 (Port static graph implementation)
Tue, 29 Sep 2009 11:03:34 GMT Peter Kovacs [825:a143f19f465b]
* lemon/bits/graph_extender.h (modified)
* lemon/edge_set.h (modified)
* lemon/full_graph.h (modified)
* lemon/hypercube_graph.h (modified)
* lemon/smart_graph.h (modified)
* lemon/static_graph.h (modified)
Make some graph member functions static (#311, #68)
Sun, 23 Aug 2009 09:09:22 GMT Peter Kovacs [782:853fcddcf282]
* doc/groups.dox (modified)
* lemon/full_graph.h (modified)
* lemon/grid_graph.h (modified)
* lemon/hypercube_graph.h (modified)
* lemon/list_graph.h (modified)
* lemon/smart_graph.h (modified)
Doc improvements, fixes and unifications for graphs (#311)
Fri, 24 Apr 2009 09:54:48 GMT Peter Kovacs [664:4137ef9aacc6]
* lemon/adaptors.h (modified)
* lemon/bits/array_map.h (modified)
* lemon/bits/base_extender.h (modified)
* lemon/bits/default_map.h (modified)
* lemon/bits/edge_set_extender.h (modified)
* lemon/bits/graph_adaptor_extender.h (modified)
* lemon/bits/graph_extender.h (modified)
* lemon/bits/map_extender.h (modified)
* lemon/bits/vector_map.h (modified)
* lemon/concepts/graph_components.h (modified)
* lemon/core.h (modified)
* lemon/edge_set.h (modified)
* lemon/full_graph.h (modified)
* lemon/graph_to_eps.h (modified)
* lemon/grid_graph.h (modified)
* lemon/hypercube_graph.h (modified)
* lemon/list_graph.h (modified)
* lemon/maps.h (modified)
* lemon/smart_graph.h (modified)
Fix and uniform the usage of Graph and Parent typedefs (#268)
- ...
Tue, 14 Apr 2009 08:54:42 GMT Peter Kovacs [629:7a28e215f715]
* lemon/full_graph.h (modified)
* lemon/grid_graph.h (modified)
* lemon/hypercube_graph.h (modified)
* lemon/list_graph.h (modified)
* lemon/smart_graph.h (modified)
Remove notes about reference maps as extra features (#190)
Wed, 31 Dec 2008 23:00:00 GMT Alpar Juttner [463:88ed40ad0d4f]
* LICENSE (modified)
* demo/arg_parser_demo.cc (modified)
* demo/graph_to_eps_demo.cc (modified)
* demo/lgf_demo.cc (modified)
* doc/coding_style.dox (modified)
* doc/dirs.dox (modified)
* doc/groups.dox (modified)
* doc/lgf.dox (modified)
* doc/license.dox (modified)
* doc/mainpage.dox (modified)
* doc/migration.dox (modified)
* doc/named-param.dox (modified)
* doc/namespaces.dox (modified)
* doc/template.h (modified)
* lemon/Makefile.am (modified)
* lemon/adaptors.h (modified)
* lemon/arg_parser.cc (modified)
* lemon/arg_parser.h (modified)
* lemon/assert.h (modified)
* lemon/base.cc (modified)
* lemon/bfs.h (modified)
* lemon/bin_heap.h (modified)
* lemon/bits/alteration_notifier.h (modified)
* lemon/bits/array_map.h (modified)
* lemon/bits/base_extender.h (modified)
* lemon/bits/bezier.h (modified)
* lemon/bits/default_map.h (modified)
* lemon/bits/enable_if.h (modified)
* lemon/bits/graph_adaptor_extender.h (modified)
* lemon/bits/graph_extender.h (modified)
* lemon/bits/map_extender.h (modified)
* lemon/bits/path_dump.h (modified)
* lemon/bits/traits.h (modified)
* lemon/bits/variant.h (modified)
* lemon/bits/vector_map.h (modified)
* lemon/circulation.h (modified)
* lemon/color.cc (modified)
* lemon/color.h (modified)
* lemon/concept_check.h (modified)
* lemon/concepts/digraph.h (modified)
* lemon/concepts/graph.h (modified)
* lemon/concepts/graph_components.h (modified)
* lemon/concepts/heap.h (modified)
* lemon/concepts/maps.h (modified)
* lemon/concepts/path.h (modified)
* lemon/connectivity.h (modified)
* lemon/core.h (modified)
* lemon/counter.h (modified)
* lemon/dfs.h (modified)
* lemon/dijkstra.h (modified)
* lemon/dim2.h (modified)
* lemon/dimacs.h (modified)
* lemon/elevator.h (modified)
* lemon/error.h (modified)
* lemon/full_graph.h (modified)
* lemon/graph_to_eps.h (modified)
* lemon/grid_graph.h (modified)
* lemon/hao_orlin.h (modified)
* lemon/hypercube_graph.h (modified)
* lemon/kruskal.h (modified)
* lemon/lgf_reader.h (modified)
* lemon/lgf_writer.h (modified)
* lemon/list_graph.h (modified)
* lemon/maps.h (modified)
* lemon/math.h (modified)
* lemon/max_matching.h (modified)
* lemon/nauty_reader.h (modified)
* lemon/path.h (modified)
* lemon/preflow.h (modified)
* lemon/random.cc (modified)
* lemon/random.h (modified)
* lemon/smart_graph.h (modified)
* lemon/suurballe.h (modified)
* lemon/time_measure.h (modified)
* lemon/tolerance.h (modified)
* lemon/unionfind.h (modified)
* test/Makefile.am (modified)
* test/bfs_test.cc (modified)
* test/circulation_test.cc (modified)
* test/counter_test.cc (modified)
* test/dfs_test.cc (modified)
* test/digraph_test.cc (modified)
* test/dijkstra_test.cc (modified)
* test/dim_test.cc (modified)
* test/error_test.cc (modified)
* test/graph_adaptor_test.cc (modified)
* test/graph_copy_test.cc (modified)
* test/graph_test.cc (modified)
* test/graph_test.h (modified)
* test/graph_utils_test.cc (modified)
* test/hao_orlin_test.cc (modified)
* test/heap_test.cc (modified)
* test/kruskal_test.cc (modified)
* test/maps_test.cc (modified)
* test/max_matching_test.cc (modified)
* test/path_test.cc (modified)
* test/preflow_test.cc (modified)
* test/random_test.cc (modified)
* test/suurballe_test.cc (modified)
* test/test_tools.h (modified)
* test/test_tools_fail.cc (modified)
* test/test_tools_pass.cc (modified)
* test/time_measure_test.cc (modified)
* test/unionfind_test.cc (modified)
* tools/dimacs-to-lgf.cc (modified)
Happy New Year again
- update the copyright headers + run the ...
Tue, 04 Nov 2008 20:36:46 GMT Peter Kovacs [372:75cf49ce5390]
* lemon/bits/traits.h (modified)
* lemon/full_graph.h (modified)
* lemon/grid_graph.h (modified)
* lemon/smart_graph.h (modified)
Add missing tags and indicators
Mon, 03 Nov 2008 21:30:21 GMT Peter Kovacs [367:aa75d24ba7d0]
* lemon/full_graph.h (modified)
Bug fix in FullDigraphBase::findArc()
Sat, 01 Nov 2008 18:22:18 GMT Peter Kovacs [366:80a4d0742e98]
* lemon/full_graph.h (modified)
* test/digraph_test.cc (modified)
Improvements related to full graphs (#57)
Thu, 14 Aug 2008 19:49:39 GMT Balazs Dezso [365:37557a46e298]
* lemon/Makefile.am (modified)
* lemon/full_graph.h (added)
* test/digraph_test.cc (modified)
* test/graph_test.cc (modified)
Porting full graphs from svn 3498
- the FullGraph is redesigned in ...