# Changeset 582:04cd483c2dbc in lemon-0.x

Ignore:
Timestamp:
05/08/04 10:18:44 (18 years ago)
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@759
Message:

aprosagok

File:
1 edited

Unmodified
Removed
• ## src/work/jacint/max_matching.h

 r537 public: MaxMatching(Graph& _G) : G(_G), mate(_G,INVALID), position(_G,C) {} MaxMatching(const Graph& _G) : G(_G), mate(_G,INVALID), position(_G,C) {} ///Runs Edmonds' algorithm. ///heuristic of postponing shrinks for dense graphs. \pre Before ///the subsequent calls \ref resetPos must be called. void run(); inline void run(); ///Runs Edmonds' algorithm. ///Returns the size of the actual matching stored. After \ref ///run() it returns the size of a maximum matching in the graph. int size(); int size () const; ///Resets the map storing the Gallai-Edmonds decomposition. ///map[v]=u will hold, and now \c uv is an edge of the matching. template void writeNMapNode(NMapN& map) { void writeNMapNode (NMapN& map) const { NodeIt v; for( G.first(v); G.valid(v); G.next(v)) { ///edge is an edge of the matching. template void writeNMapEdge(NMapE& map) { void writeNMapEdge (NMapE& map)  const { typename Graph::template NodeMap todo(G,false); NodeIt v; ///map[e]=true form the matching. template void writeEMapBool(EMapB& map) { void writeEMapBool (EMapB& map) const { typename Graph::template NodeMap todo(G,false); NodeIt v; ///decomposition of the graph. \c map must be a node map of \ref pos_enum 's. template void writePos(NMapEnum& map) { void writePos (NMapEnum& map) const { NodeIt v; for( G.first(v); G.valid(v); G.next(v)) map.set(v,position[v]); template int MaxMatching::size() { int MaxMatching::size() const { int s=0; NodeIt v;
Note: See TracChangeset for help on using the changeset viewer.