Changes in / [592:2ebfdb89ec66:595:16d7255a6849] in lemon-main
- Files:
-
- 2 added
- 2 deleted
- 5 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/groups.dox
r586 r590 436 436 \brief Algorithms for finding matchings in graphs and bipartite graphs. 437 437 438 This group contains algorithm objects and functions to calculate438 This group contains the algorithms for calculating 439 439 matchings in graphs and bipartite graphs. The general matching problem is 440 finding a subset of the arcs which does not shares common endpoints. 440 finding a subset of the edges for which each node has at most one incident 441 edge. 441 442 442 443 There are several different algorithms for calculate matchings in -
lemon/Makefile.am
r567 r594 90 90 lemon/list_graph.h \ 91 91 lemon/maps.h \ 92 lemon/matching.h \ 92 93 lemon/math.h \ 93 lemon/max_matching.h \94 94 lemon/min_cost_arborescence.h \ 95 95 lemon/nauty_reader.h \ -
test/CMakeLists.txt
r549 r594 30 30 kruskal_test 31 31 maps_test 32 ma x_matching_test32 matching_test 33 33 min_cost_arborescence_test 34 34 path_test -
test/Makefile.am
r564 r594 26 26 test/kruskal_test \ 27 27 test/maps_test \ 28 test/ma x_matching_test \28 test/matching_test \ 29 29 test/min_cost_arborescence_test \ 30 30 test/path_test \ … … 71 71 test_maps_test_SOURCES = test/maps_test.cc 72 72 test_mip_test_SOURCES = test/mip_test.cc 73 test_ma x_matching_test_SOURCES = test/max_matching_test.cc73 test_matching_test_SOURCES = test/matching_test.cc 74 74 test_min_cost_arborescence_test_SOURCES = test/min_cost_arborescence_test.cc 75 75 test_path_test_SOURCES = test/path_test.cc -
tools/dimacs-solver.cc
r584 r594 43 43 #include <lemon/dijkstra.h> 44 44 #include <lemon/preflow.h> 45 #include <lemon/ma x_matching.h>45 #include <lemon/matching.h> 46 46 47 47 using namespace lemon;
Note: See TracChangeset
for help on using the changeset viewer.