COIN-OR::LEMON - Graph Library

Changeset 803:c3d832275e69 in lemon-0.x for src/work/klao/path.h


Ignore:
Timestamp:
09/05/04 22:13:48 (17 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1097
Message:
  • Clarified Path skeleton.
  • setStart() changed to setStartNode()
File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/work/klao/path.h

    r686 r803  
    304304      /// It should be called iff the path is empty and before any call to
    305305      /// \ref pushFront() or \ref pushBack()
    306       void setStart(const GraphNode &) {}
     306      void setStartNode(const GraphNode &) {}
    307307
    308308      ///Push a new edge to the front of the path
    309309
    310310      ///Push a new edge to the front of the path.
    311       ///\sa setStart
     311      ///\sa setStartNode
    312312      void pushFront(const GraphEdge& e) {
    313313        if( DM::consistensy_check && !empty() && P.gr->head(e)!=from() ) {
     
    320320
    321321      ///Push a new edge to the back of the path.
    322       ///\sa setStart
     322      ///\sa setStartNode
    323323      void pushBack(const GraphEdge& e) {
    324324        if( DM::consistensy_check && !empty() && P.gr->tail(e)!=to() ) {
     
    345345      // Hogy kenyelmes egy ilyet hasznalni?
    346346 
    347       ///Reserve storage in advance for the builder
     347      ///Reserve storage for the builder in advance.
    348348
    349349      ///If you know an reasonable upper bound of the number of the edges
     
    665665      /// It should be called iff the path is empty and before any call to
    666666      /// \ref pushFront() or \ref pushBack()
    667       void setStart(const GraphNode &) {}
     667      void setStartNode(const GraphNode &) {}
    668668
    669669      ///Push a new edge to the front of the path
    670670
    671671      ///Push a new edge to the front of the path.
    672       ///\sa setStart
     672      ///\sa setStartNode
    673673      void pushFront(const GraphEdge& e) {
    674674        if( DM::consistensy_check && !empty() && P.gr->head(e)!=from() ) {
     
    681681
    682682      ///Push a new edge to the back of the path.
    683       ///\sa setStart
     683      ///\sa setStartNode
    684684      void pushBack(const GraphEdge& e) {
    685685        if( DM::consistensy_check && !empty() && P.gr->tail(e)!=to() ) {
     
    706706      // Hogy kenyelmes egy ilyet hasznalni?
    707707
    708       ///Reserve storage in advance for the builder
     708      ///Reserve storage for the builder in advance.
    709709
    710710      ///If you know an reasonable upper bound of the number of the edges
Note: See TracChangeset for help on using the changeset viewer.