1.1 --- a/lemon/static_graph.h Tue Sep 29 10:39:20 2009 +0200
1.2 +++ b/lemon/static_graph.h Tue Sep 29 13:03:34 2009 +0200
1.3 @@ -92,12 +92,12 @@
1.4 void firstIn(Arc& e, const Node& n) const { e.id = node_first_in[n.id]; }
1.5 void nextIn(Arc& e) const { e.id = arc_next_in[e.id]; }
1.6
1.7 - int id(const Node& n) const { return n.id; }
1.8 - Node nodeFromId(int id) const { return Node(id); }
1.9 + static int id(const Node& n) { return n.id; }
1.10 + static Node nodeFromId(int id) { return Node(id); }
1.11 int maxNodeId() const { return node_num - 1; }
1.12
1.13 - int id(const Arc& e) const { return e.id; }
1.14 - Arc arcFromId(int id) const { return Arc(id); }
1.15 + static int id(const Arc& e) { return e.id; }
1.16 + static Arc arcFromId(int id) { return Arc(id); }
1.17 int maxArcId() const { return arc_num - 1; }
1.18
1.19 typedef True NodeNumTag;
1.20 @@ -268,25 +268,25 @@
1.21 ///
1.22 /// This function returns the node with the given index.
1.23 /// \sa index()
1.24 - Node node(int ix) const { return Parent::nodeFromId(ix); }
1.25 + static Node node(int ix) { return Parent::nodeFromId(ix); }
1.26
1.27 /// \brief The arc with the given index.
1.28 ///
1.29 /// This function returns the arc with the given index.
1.30 /// \sa index()
1.31 - Arc arc(int ix) const { return Parent::arcFromId(ix); }
1.32 + static Arc arc(int ix) { return Parent::arcFromId(ix); }
1.33
1.34 /// \brief The index of the given node.
1.35 ///
1.36 /// This function returns the index of the the given node.
1.37 /// \sa node()
1.38 - int index(Node node) const { return Parent::id(node); }
1.39 + static int index(Node node) { return Parent::id(node); }
1.40
1.41 /// \brief The index of the given arc.
1.42 ///
1.43 /// This function returns the index of the the given arc.
1.44 /// \sa arc()
1.45 - int index(Arc arc) const { return Parent::id(arc); }
1.46 + static int index(Arc arc) { return Parent::id(arc); }
1.47
1.48 /// \brief Number of nodes.
1.49 ///