Changes in / [824:5764dd9b6e18:826:c160bf9f18ef] in lemon
 Location:
 lemon
 Files:

 6 edited
Legend:
 Unmodified
 Added
 Removed

lemon/bits/graph_extender.h
r732 r825 57 57 } 58 58 59 Node fromId(int id, Node) const{59 static Node fromId(int id, Node) { 60 60 return Parent::nodeFromId(id); 61 61 } 62 62 63 Arc fromId(int id, Arc) const{63 static Arc fromId(int id, Arc) { 64 64 return Parent::arcFromId(id); 65 65 } … … 356 356 } 357 357 358 Node fromId(int id, Node) const{358 static Node fromId(int id, Node) { 359 359 return Parent::nodeFromId(id); 360 360 } 361 361 362 Arc fromId(int id, Arc) const{362 static Arc fromId(int id, Arc) { 363 363 return Parent::arcFromId(id); 364 364 } 365 365 366 Edge fromId(int id, Edge) const{366 static Edge fromId(int id, Edge) { 367 367 return Parent::edgeFromId(id); 368 368 } 
lemon/edge_set.h
r717 r825 868 868 } 869 869 870 void next(Arc& arc) const{870 static void next(Arc& arc) { 871 871 arc.id; 872 872 } … … 1174 1174 } 1175 1175 1176 void next(Arc& arc) const{1176 static void next(Arc& arc) { 1177 1177 arc.id; 1178 1178 } … … 1182 1182 } 1183 1183 1184 void next(Edge& arc) const{1184 static void next(Edge& arc) { 1185 1185 arc.id; 1186 1186 } 
lemon/full_graph.h
r664 r825 52 52 53 53 Node operator()(int ix) const { return Node(ix); } 54 int index(const Node& node) const{ return node._id; }54 static int index(const Node& node) { return node._id; } 55 55 56 56 Arc arc(const Node& s, const Node& t) const { … … 210 210 /// <tt>[0..nodeNum()1]</tt>. 211 211 /// \sa operator() 212 int index(const Node& node) const{ return Parent::index(node); }212 static int index(const Node& node) { return Parent::index(node); } 213 213 214 214 /// \brief Returns the arc connecting the given nodes. … … 284 284 285 285 Node operator()(int ix) const { return Node(ix); } 286 int index(const Node& node) const{ return node._id; }286 static int index(const Node& node) { return node._id; } 287 287 288 288 Edge edge(const Node& u, const Node& v) const { … … 581 581 /// <tt>[0..nodeNum()1]</tt>. 582 582 /// \sa operator() 583 int index(const Node& node) const{ return Parent::index(node); }583 static int index(const Node& node) { return Parent::index(node); } 584 584 585 585 /// \brief Returns the arc connecting the given nodes. 
lemon/hypercube_graph.h
r664 r825 263 263 } 264 264 265 int index(Node node) const{265 static int index(Node node) { 266 266 return node._id; 267 267 } … … 338 338 /// Gives back the index of the given node. 339 339 /// The lower bits of the integer describes the node. 340 int index(Node node) const{340 static int index(Node node) { 341 341 return Parent::index(node); 342 342 } 
lemon/smart_graph.h
r664 r825 509 509 } 510 510 511 void next(Node& node) const{511 static void next(Node& node) { 512 512 node._id; 513 513 } … … 517 517 } 518 518 519 void next(Arc& arc) const{519 static void next(Arc& arc) { 520 520 arc._id; 521 521 } … … 525 525 } 526 526 527 void next(Edge& arc) const{527 static void next(Edge& arc) { 528 528 arc._id; 529 529 } 
lemon/static_graph.h
r824 r826 93 93 void nextIn(Arc& e) const { e.id = arc_next_in[e.id]; } 94 94 95 int id(const Node& n) const{ return n.id; }96 Node nodeFromId(int id) const{ return Node(id); }95 static int id(const Node& n) { return n.id; } 96 static Node nodeFromId(int id) { return Node(id); } 97 97 int maxNodeId() const { return node_num  1; } 98 98 99 int id(const Arc& e) const{ return e.id; }100 Arc arcFromId(int id) const{ return Arc(id); }99 static int id(const Arc& e) { return e.id; } 100 static Arc arcFromId(int id) { return Arc(id); } 101 101 int maxArcId() const { return arc_num  1; } 102 102 … … 310 310 /// This function returns the node with the given index. 311 311 /// \sa index() 312 Node node(int ix) const{ return Parent::nodeFromId(ix); }312 static Node node(int ix) { return Parent::nodeFromId(ix); } 313 313 314 314 /// \brief The arc with the given index. … … 316 316 /// This function returns the arc with the given index. 317 317 /// \sa index() 318 Arc arc(int ix) const{ return Parent::arcFromId(ix); }318 static Arc arc(int ix) { return Parent::arcFromId(ix); } 319 319 320 320 /// \brief The index of the given node. … … 322 322 /// This function returns the index of the the given node. 323 323 /// \sa node() 324 int index(Node node) const{ return Parent::id(node); }324 static int index(Node node) { return Parent::id(node); } 325 325 326 326 /// \brief The index of the given arc. … … 328 328 /// This function returns the index of the the given arc. 329 329 /// \sa arc() 330 int index(Arc arc) const{ return Parent::id(arc); }330 static int index(Arc arc) { return Parent::id(arc); } 331 331 332 332 /// \brief Number of nodes.
Note: See TracChangeset
for help on using the changeset viewer.