Index: lemon/full_graph.h
===================================================================
--- lemon/full_graph.h (revision 782)
+++ lemon/full_graph.h (revision 834)
@@ -52,5 +52,5 @@
Node operator()(int ix) const { return Node(ix); }
- int index(const Node& node) const { return node._id; }
+ static int index(const Node& node) { return node._id; }
Arc arc(const Node& s, const Node& t) const {
@@ -163,4 +163,6 @@
/// only in the concept class.
///
+ /// This class provides constant time counting for nodes and arcs.
+ ///
/// \note FullDigraph and FullGraph classes are very similar,
/// but there are two differences. While this class conforms only
@@ -205,4 +207,5 @@
/// completely static, the nodes can be indexed with integers from
/// the range [0..nodeNum()-1].
+ /// The index of a node is the same as its ID.
/// \sa index()
Node operator()(int ix) const { return Parent::operator()(ix); }
@@ -213,6 +216,7 @@
/// completely static, the nodes can be indexed with integers from
/// the range [0..nodeNum()-1].
+ /// The index of a node is the same as its ID.
/// \sa operator()()
- int index(Node node) const { return Parent::index(node); }
+ static int index(const Node& node) { return Parent::index(node); }
/// \brief Returns the arc connecting the given nodes.
@@ -288,5 +292,5 @@
Node operator()(int ix) const { return Node(ix); }
- int index(const Node& node) const { return node._id; }
+ static int index(const Node& node) { return node._id; }
Edge edge(const Node& u, const Node& v) const {
@@ -536,4 +540,6 @@
/// only in the concept class.
///
+ /// This class provides constant time counting for nodes, edges and arcs.
+ ///
/// \note FullDigraph and FullGraph classes are very similar,
/// but there are two differences. While FullDigraph
@@ -580,4 +586,5 @@
/// completely static, the nodes can be indexed with integers from
/// the range [0..nodeNum()-1].
+ /// The index of a node is the same as its ID.
/// \sa index()
Node operator()(int ix) const { return Parent::operator()(ix); }
@@ -588,6 +595,7 @@
/// completely static, the nodes can be indexed with integers from
/// the range [0..nodeNum()-1].
+ /// The index of a node is the same as its ID.
/// \sa operator()()
- int index(Node node) const { return Parent::index(node); }
+ static int index(const Node& node) { return Parent::index(node); }
/// \brief Returns the arc connecting the given nodes.