1.1 --- a/src/hugo/full_graph.h Tue Jul 20 09:52:03 2004 +0000
1.2 +++ b/src/hugo/full_graph.h Tue Jul 20 10:58:11 2004 +0000
1.3 @@ -77,8 +77,8 @@
1.4 InEdgeIt& first(InEdgeIt& e, const Node v) const {
1.5 e=InEdgeIt(*this,v); return e; }
1.6
1.7 - static bool valid(Edge e) const { return e.n!=-1; }
1.8 - static bool valid(Node n) const { return n.n!=-1; }
1.9 + static bool valid(Edge e) { return e.n!=-1; }
1.10 + static bool valid(Node n) { return n.n!=-1; }
1.11
1.12 template <typename It> It getNext(It it) const
1.13 { It tmp(it); return next(tmp); }
1.14 @@ -91,10 +91,10 @@
1.15 { it.n+=NodeNum; if(it.n>=EdgeNum) it.n=-1; return it; }
1.16 InEdgeIt& next(InEdgeIt& it) const
1.17 { if(!((++it.n)%NodeNum)) it.n=-1; return it; }
1.18 - static EdgeIt& next(EdgeIt& it) const { --it.n; return it; }
1.19 + static EdgeIt& next(EdgeIt& it) { --it.n; return it; }
1.20
1.21 - static int id(Node v) const { return v.n; }
1.22 - static int id(Edge e) const { return e.n; }
1.23 + static int id(Node v) { return v.n; }
1.24 + static int id(Edge e) { return e.n; }
1.25
1.26 class Node {
1.27 friend class FullGraph;