Changeset 1470:9b6f8c3587f0 in lemon-0.x

Timestamp:

06/10/05 14:16:25 (19 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

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

Message:

Minor changes

Location:

lemon

Files:

• concept/graph.h (modified) (2 diffs)
• graph_to_eps.h (modified) (2 diffs)
• graph_utils.h (modified) (1 diff)
• list_graph.h (modified) (1 diff)

lemon/concept/graph.h

@@ -212 +212 @@
         /// Node -> NodeIt conversion.
 
-        /// Sets the iterator to the node of \c g pointed by the trivial 
-        /// iterator n.
+        /// Sets the iterator to the node of \c the graph pointed by 
+        /// the trivial iterator.
         /// This feature necessitates that each time we 
         /// iterate the edge-set, the iteration order is the same.
-        NodeIt(const StaticGraph& g, const Node& n) { }
+        NodeIt(const StaticGraph&, const Node&) { }
         /// Next node.
 
@@ -296 +296 @@
         /// Edge -> OutEdgeIt conversion
 
-        /// Sets the iterator to the value of the trivial iterator \c e.
-        /// This feature necessitates that each time we 
+        /// Sets the iterator to the value of the trivial iterator.
+        /// This feature necessitates that each time we 
         /// iterate the edge-set, the iteration order is the same.
-        OutEdgeIt(const StaticGraph& g, const Edge& e) { }
+        OutEdgeIt(const StaticGraph&, const Edge&) { }
         ///Next outgoing edge
         

lemon/graph_to_eps.h

@@ -776 +776 @@
     if(_scaleToA4)
       if(bb.height()>bb.width()) {
-        double sc= min((A4HEIGHT-2*A4BORDER)/bb.height(),
+        double sc= std::min((A4HEIGHT-2*A4BORDER)/bb.height(),
                   (A4WIDTH-2*A4BORDER)/bb.width());
         os << ((A4WIDTH -2*A4BORDER)-sc*bb.width())/2 + A4BORDER << ' '
@@ -785 +785 @@
       else {
         //\todo Verify centering
-        double sc= min((A4HEIGHT-2*A4BORDER)/bb.width(),
+        double sc= std::min((A4HEIGHT-2*A4BORDER)/bb.width(),
                   (A4WIDTH-2*A4BORDER)/bb.height());
         os << ((A4WIDTH -2*A4BORDER)-sc*bb.height())/2 + A4BORDER << ' '

lemon/graph_utils.h

@@ -679 +679 @@
         return inverted.invMap[key];
       }
+
+      /// \brief Size of the map.
+      ///
+      /// Returns the size of the map.
+      unsigned size() const {
+        return inverted.invMap.size();
+      }
       
     private:

lemon/list_graph.h

@@ -39 +39 @@
   protected:
     struct NodeT {
-      int first_in,first_out;
+      int first_in, first_out;
       int prev, next;
     };