COIN-OR::LEMON - Graph Library

Ignore:
Files:
2 added
2 deleted
5 edited

Legend:

Unmodified
Added
Removed
  • doc/groups.dox

    r637 r633  
    436436\brief Algorithms for finding matchings in graphs and bipartite graphs.
    437437
    438 This group contains the algorithms for calculating
     438This group contains algorithm objects and functions to calculate
    439439matchings in graphs and bipartite graphs. The general matching problem is
    440 finding a subset of the edges for which each node has at most one incident
    441 edge.
     440finding a subset of the arcs which does not shares common endpoints.
    442441
    443442There are several different algorithms for calculate matchings in
  • lemon/Makefile.am

    r641 r614  
    9090        lemon/list_graph.h \
    9191        lemon/maps.h \
    92         lemon/matching.h \
    9392        lemon/math.h \
     93        lemon/max_matching.h \
    9494        lemon/min_cost_arborescence.h \
    9595        lemon/nauty_reader.h \
  • test/CMakeLists.txt

    r641 r596  
    3030  kruskal_test
    3131  maps_test
    32   matching_test
     32  max_matching_test
    3333  min_cost_arborescence_test
    3434  path_test
  • test/Makefile.am

    r641 r611  
    2626        test/kruskal_test \
    2727        test/maps_test \
    28         test/matching_test \
     28        test/max_matching_test \
    2929        test/min_cost_arborescence_test \
    3030        test/path_test \
     
    7171test_maps_test_SOURCES = test/maps_test.cc
    7272test_mip_test_SOURCES = test/mip_test.cc
    73 test_matching_test_SOURCES = test/matching_test.cc
     73test_max_matching_test_SOURCES = test/max_matching_test.cc
    7474test_min_cost_arborescence_test_SOURCES = test/min_cost_arborescence_test.cc
    7575test_path_test_SOURCES = test/path_test.cc
  • tools/dimacs-solver.cc

    r641 r631  
    4343#include <lemon/dijkstra.h>
    4444#include <lemon/preflow.h>
    45 #include <lemon/matching.h>
     45#include <lemon/max_matching.h>
    4646
    4747using namespace lemon;
Note: See TracChangeset for help on using the changeset viewer.