COIN-OR::LEMON - Graph Library

Changeset 1367:a490662291b9 in lemon-0.x for src/lemon/concept/graph.h


Ignore:
Timestamp:
04/18/05 16:59:24 (16 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1812
Message:

More steps toward gcc-3.4 compatibility

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/lemon/concept/graph.h

    r1359 r1367  
    186186        /// Copy constructor.
    187187        ///
    188         NodeIt(const NodeIt&) { }
     188        NodeIt(const NodeIt& n) : Node(n) { }
    189189        /// Invalid constructor \& conversion.
    190190
     
    196196        /// Sets the iterator to the first node of \c g.
    197197        ///
    198         NodeIt(const StaticGraph& g) { }
     198        NodeIt(const StaticGraph&) { }
    199199        /// Node -> NodeIt conversion.
    200200
     
    268268        /// Copy constructor.
    269269        ///
    270         OutEdgeIt(const OutEdgeIt&) { }
     270        OutEdgeIt(const OutEdgeIt& e) : Edge(e) { }
    271271        /// Initialize the iterator to be invalid.
    272272
     
    280280        ///@param n the node
    281281        ///@param g the graph
    282         OutEdgeIt(const StaticGraph& g, const Node& n) { }
     282        OutEdgeIt(const StaticGraph&, const Node&) { }
    283283        /// Edge -> OutEdgeIt conversion
    284284
     
    317317        /// Copy constructor.
    318318        ///
    319         InEdgeIt(const InEdgeIt&) { }
     319        InEdgeIt(const InEdgeIt& e) : Edge(e) { }
    320320        /// Initialize the iterator to be invalid.
    321321
     
    329329        ///@param n the node
    330330        ///@param g the graph
    331         InEdgeIt(const StaticGraph& g, const Node& n) { }
     331        InEdgeIt(const StaticGraph&, const Node&) { }
    332332        /// Edge -> InEdgeIt conversion
    333333
     
    335335        /// This feature necessitates that each time we
    336336        /// iterate the edge-set, the iteration order is the same.
    337         InEdgeIt(const StaticGraph& g, const Edge& n) { }
     337        InEdgeIt(const StaticGraph&, const Edge&) { }
    338338        /// Next incoming edge
    339339
     
    362362        /// Copy constructor.
    363363        ///
    364         EdgeIt(const EdgeIt&) { }
     364        EdgeIt(const EdgeIt& e) : Edge(e) { }
    365365        /// Initialize the iterator to be invalid.
    366366
     
    373373        /// node
    374374        ///@param g the graph
    375         EdgeIt(const StaticGraph& g) { }
     375        EdgeIt(const StaticGraph&) { }
    376376        /// Edge -> EdgeIt conversion
    377377
     
    414414
    415415        ///Copy constructor
    416         NodeMap(const NodeMap&) { }
     416        NodeMap(const NodeMap& nm) : ReadWriteMap< Node, T >(nm) { }
    417417        ///Assignment operator
    418418        NodeMap& operator=(const NodeMap&) { return *this; }
     
    437437        EdgeMap(const StaticGraph&, T) { }
    438438        ///Copy constructor
    439         EdgeMap(const EdgeMap&) { }
     439        EdgeMap(const EdgeMap& em) : ReadWriteMap<Edge,T>(em) { }
    440440        ///Assignment operator
    441441        EdgeMap& operator=(const EdgeMap&) { return *this; }
     
    471471      ///and target node \c t.
    472472      ///\return the new edge.
    473       Edge addEdge(Node s, Node t) { return INVALID; }
     473      Edge addEdge(Node, Node) { return INVALID; }
    474474   
    475475      /// Resets the graph.
     
    501501      /// Deletes node \c n node.
    502502      ///
    503       void erase(Node n) { }
     503      void erase(Node) { }
    504504      /// Deletes an edge.
    505505
    506506      /// Deletes edge \c e edge.
    507507      ///
    508       void erase(Edge e) { }
     508      void erase(Edge) { }
    509509
    510510      template <typename _Graph>
Note: See TracChangeset for help on using the changeset viewer.