Changeset 713:57c0b110b31e in lemon-0.x for src/hugo/smart_graph.h
- Timestamp:
- 07/20/04 12:58:11 (21 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@965
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/hugo/smart_graph.h
r706 r713 137 137 // It first(Node v) const { It e; first(e,v); return e; } 138 138 139 bool valid(Edge e) const{ return e.n!=-1; }140 bool valid(Node n) const{ return n.n!=-1; }139 static bool valid(Edge e) { return e.n!=-1; } 140 static bool valid(Node n) { return n.n!=-1; } 141 141 142 142 ///\deprecated Use … … 145 145 ///\endcode 146 146 ///instead. 147 void setInvalid(Edge &e) { e.n=-1; }147 static void setInvalid(Edge &e) { e.n=-1; } 148 148 ///\deprecated Use 149 149 ///\code … … 151 151 ///\endcode 152 152 ///instead. 153 void setInvalid(Node &n) { n.n=-1; }153 static void setInvalid(Node &n) { n.n=-1; } 154 154 155 155 template <typename It> It getNext(It it) const … … 166 166 EdgeIt& next(EdgeIt& it) const { --it.n; return it; } 167 167 168 int id(Node v) const{ return v.n; }169 int id(Edge e) const{ return e.n; }168 static int id(Node v) { return v.n; } 169 static int id(Edge e) { return e.n; } 170 170 171 171 Node addNode() { … … 504 504 ///Returns the oppositely directed 505 505 ///pair of the edge \c e. 506 Edge opposite(Edge e) const506 static Edge opposite(Edge e) 507 507 { 508 508 Edge f;
Note: See TracChangeset
for help on using the changeset viewer.