COIN-OR::LEMON - Graph Library

Changeset 1470:9b6f8c3587f0 in lemon-0.x for lemon/concept/graph.h


Ignore:
Timestamp:
06/10/05 14:16:25 (15 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1950
Message:

Minor changes

File:
1 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       
Note: See TracChangeset for help on using the changeset viewer.