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

Timestamp:

09/05/04 22:13:48 (20 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:

• src/work/klao/path.h (modified) (6 diffs)

src/work/klao/path.h

@@ -304 +304 @@
       /// It should be called iff the path is empty and before any call to
       /// \ref pushFront() or \ref pushBack()
-      void setStart(const GraphNode &) {}
+      void setStartNode(const GraphNode &) {}
 
       ///Push a new edge to the front of the path
 
       ///Push a new edge to the front of the path.
-      ///\sa setStart
+      ///\sa setStartNode
       void pushFront(const GraphEdge& e) {
         if( DM::consistensy_check && !empty() && P.gr->head(e)!=from() ) {
@@ -320 +320 @@
 
       ///Push a new edge to the back of the path.
-      ///\sa setStart
+      ///\sa setStartNode
       void pushBack(const GraphEdge& e) {
         if( DM::consistensy_check && !empty() && P.gr->tail(e)!=to() ) {
@@ -345 +345 @@
       // Hogy kenyelmes egy ilyet hasznalni?
   
-      ///Reserve storage in advance for the builder
+      ///Reserve storage for the builder in advance.
 
       ///If you know an reasonable upper bound of the number of the edges
@@ -665 +665 @@
       /// It should be called iff the path is empty and before any call to
       /// \ref pushFront() or \ref pushBack()
-      void setStart(const GraphNode &) {}
+      void setStartNode(const GraphNode &) {}
 
       ///Push a new edge to the front of the path
 
       ///Push a new edge to the front of the path.
-      ///\sa setStart
+      ///\sa setStartNode
       void pushFront(const GraphEdge& e) {
         if( DM::consistensy_check && !empty() && P.gr->head(e)!=from() ) {
@@ -681 +681 @@
 
       ///Push a new edge to the back of the path.
-      ///\sa setStart
+      ///\sa setStartNode
       void pushBack(const GraphEdge& e) {
         if( DM::consistensy_check && !empty() && P.gr->tail(e)!=to() ) {
@@ -706 +706 @@
       // Hogy kenyelmes egy ilyet hasznalni?
 
-      ///Reserve storage in advance for the builder
+      ///Reserve storage for the builder in advance.
 
       ///If you know an reasonable upper bound of the number of the edges