COIN-OR::LEMON - Graph Library

Changeset 1470:9b6f8c3587f0 in lemon-0.x


Ignore:
Timestamp:
06/10/05 14:16:25 (14 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:
4 edited

Legend:

Unmodified
Added
Removed
  • lemon/concept/graph.h

    r1448 r1470  
    212212        /// Node -> NodeIt conversion.
    213213
    214         /// Sets the iterator to the node of \c g pointed by the trivial
    215         /// iterator n.
     214        /// Sets the iterator to the node of \c the graph pointed by
     215        /// the trivial iterator.
    216216        /// This feature necessitates that each time we
    217217        /// iterate the edge-set, the iteration order is the same.
    218         NodeIt(const StaticGraph& g, const Node& n) { }
     218        NodeIt(const StaticGraph&, const Node&) { }
    219219        /// Next node.
    220220
     
    296296        /// Edge -> OutEdgeIt conversion
    297297
    298         /// Sets the iterator to the value of the trivial iterator \c e.
    299         /// This feature necessitates that each time we
     298        /// Sets the iterator to the value of the trivial iterator.
     299        /// This feature necessitates that each time we
    300300        /// iterate the edge-set, the iteration order is the same.
    301         OutEdgeIt(const StaticGraph& g, const Edge& e) { }
     301        OutEdgeIt(const StaticGraph&, const Edge&) { }
    302302        ///Next outgoing edge
    303303       
  • lemon/graph_to_eps.h

    r1435 r1470  
    776776    if(_scaleToA4)
    777777      if(bb.height()>bb.width()) {
    778         double sc= min((A4HEIGHT-2*A4BORDER)/bb.height(),
     778        double sc= std::min((A4HEIGHT-2*A4BORDER)/bb.height(),
    779779                  (A4WIDTH-2*A4BORDER)/bb.width());
    780780        os << ((A4WIDTH -2*A4BORDER)-sc*bb.width())/2 + A4BORDER << ' '
     
    785785      else {
    786786        //\todo Verify centering
    787         double sc= min((A4HEIGHT-2*A4BORDER)/bb.width(),
     787        double sc= std::min((A4HEIGHT-2*A4BORDER)/bb.width(),
    788788                  (A4WIDTH-2*A4BORDER)/bb.height());
    789789        os << ((A4WIDTH -2*A4BORDER)-sc*bb.height())/2 + A4BORDER << ' '
  • lemon/graph_utils.h

    r1467 r1470  
    679679        return inverted.invMap[key];
    680680      }
     681
     682      /// \brief Size of the map.
     683      ///
     684      /// Returns the size of the map.
     685      unsigned size() const {
     686        return inverted.invMap.size();
     687      }
    681688     
    682689    private:
  • lemon/list_graph.h

    r1457 r1470  
    3939  protected:
    4040    struct NodeT {
    41       int first_in,first_out;
     41      int first_in, first_out;
    4242      int prev, next;
    4343    };
Note: See TracChangeset for help on using the changeset viewer.