Index: lemon/path.h
===================================================================
--- lemon/path.h (revision 956)
+++ lemon/path.h (revision 1024)
@@ -44,5 +44,5 @@
///
/// In a sense, the path can be treated as a list of arcs. The
- /// lemon path type stores just this list. As a consequence, it
+ /// LEMON path type stores just this list. As a consequence, it
/// cannot enumerate the nodes of the path and the source node of
/// a zero length path is undefined.
@@ -136,5 +136,5 @@
void clear() { head.clear(); tail.clear(); }
- /// \brief The nth arc.
+ /// \brief The n-th arc.
///
/// \pre \c n is in the `[0..length() - 1]` range.
@@ -144,5 +144,5 @@
}
- /// \brief Initialize arc iterator to point to the nth arc
+ /// \brief Initialize arc iterator to point to the n-th arc
///
/// \pre \c n is in the `[0..length() - 1]` range.
@@ -232,5 +232,5 @@
///
/// In a sense, the path can be treated as a list of arcs. The
- /// lemon path type stores just this list. As a consequence it
+ /// LEMON path type stores just this list. As a consequence it
/// cannot enumerate the nodes in the path and the zero length paths
/// cannot store the source.
@@ -328,5 +328,5 @@
void clear() { data.clear(); }
- /// \brief The nth arc.
+ /// \brief The n-th arc.
///
/// \pre \c n is in the `[0..length() - 1]` range.
@@ -335,5 +335,5 @@
}
- /// \brief Initializes arc iterator to point to the nth arc.
+ /// \brief Initializes arc iterator to point to the n-th arc.
ArcIt nthIt(int n) const {
return ArcIt(*this, n);
@@ -396,5 +396,5 @@
///
/// In a sense, the path can be treated as a list of arcs. The
- /// lemon path type stores just this list. As a consequence it
+ /// LEMON path type stores just this list. As a consequence it
/// cannot enumerate the nodes in the path and the zero length paths
/// cannot store the source.
@@ -505,7 +505,7 @@
};
- /// \brief The nth arc.
- ///
- /// This function looks for the nth arc in O(n) time.
+ /// \brief The n-th arc.
+ ///
+ /// This function looks for the n-th arc in O(n) time.
/// \pre \c n is in the `[0..length() - 1]` range.
const Arc& nth(int n) const {
@@ -517,5 +517,5 @@
}
- /// \brief Initializes arc iterator to point to the nth arc.
+ /// \brief Initializes arc iterator to point to the n-th arc.
ArcIt nthIt(int n) const {
Node *node = first;
@@ -736,5 +736,5 @@
///
/// In a sense, the path can be treated as a list of arcs. The
- /// lemon path type stores just this list. As a consequence it
+ /// LEMON path type stores just this list. As a consequence it
/// cannot enumerate the nodes in the path and the source node of
/// a zero length path is undefined.
@@ -832,5 +832,5 @@
};
- /// \brief The nth arc.
+ /// \brief The n-th arc.
///
/// \pre \c n is in the `[0..length() - 1]` range.
@@ -839,5 +839,5 @@
}
- /// \brief The arc iterator pointing to the nth arc.
+ /// \brief The arc iterator pointing to the n-th arc.
ArcIt nthIt(int n) const {
return ArcIt(*this, n);
@@ -1043,5 +1043,5 @@
///
/// In a sense, the path can be treated as a list of arcs. The
- /// lemon path type stores only this list. As a consequence, it
+ /// LEMON path type stores only this list. As a consequence, it
/// cannot enumerate the nodes in the path and the zero length paths
/// cannot have a source node.