Changeset 582:04cd483c2dbc in lemon-0.x for src/work/jacint

Timestamp:

05/08/04 10:18:44 (20 years ago)

Author:

jacint

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@759

Message:

aprosagok

File:

• src/work/jacint/max_matching.h (modified) (8 diffs)

src/work/jacint/max_matching.h

@@ -72 +72 @@
   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.
@@ -80 +80 @@
     ///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.
@@ -100 +100 @@
     ///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.
@@ -135 +135 @@
     ///map[v]=u will hold, and now \c uv is an edge of the matching.
     template<typename NMapN>
-    void writeNMapNode(NMapN& map) {
+    void writeNMapNode (NMapN& map) const {
       NodeIt v;
       for( G.first(v); G.valid(v); G.next(v)) {
@@ -165 +165 @@
     ///edge is an edge of the matching.
     template<typename NMapE>
-    void writeNMapEdge(NMapE& map)  {
+    void writeNMapEdge (NMapE& map)  const {
       typename Graph::template NodeMap<bool> todo(G,false); 
       NodeIt v;
@@ -213 +213 @@
     ///map[e]=true form the matching.
     template<typename EMapB>
-    void writeEMapBool(EMapB& map) {
+    void writeEMapBool (EMapB& map) const {
       typename Graph::template NodeMap<bool> todo(G,false); 
       NodeIt v;
@@ -242 +242 @@
     ///decomposition of the graph. \c map must be a node map of \ref pos_enum 's.
     template<typename NMapEnum>
-    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]);
@@ -457 +457 @@
    
   template <typename Graph>
-  int MaxMatching<Graph>::size() {
+  int MaxMatching<Graph>::size() const {
     int s=0;
     NodeIt v;