Changes in lemon/smart_graph.h [388:2d87dbd7f8c8:313:64f8f7cc6168] in lemon
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/smart_graph.h
r388 r313 68 68 69 69 typedef True NodeNumTag; 70 typedef True ArcNumTag;70 typedef True EdgeNumTag; 71 71 72 72 int nodeNum() const { return nodes.size(); } … … 306 306 nodes[b._id].first_out=nodes[n._id].first_out; 307 307 nodes[n._id].first_out=-1; 308 for(int i=nodes[b._id].first_out; i!=-1; i=arcs[i].next_out) { 309 arcs[i].source=b._id; 310 } 308 for(int i=nodes[b._id].first_out;i!=-1;i++) arcs[i].source=b._id; 311 309 if(connect) addArc(n,b); 312 310 return b; … … 467 465 468 466 public: 469 operator Edge() const { 470 return _id != -1 ? edgeFromId(_id / 2) : INVALID; 467 operator Edge() const { 468 return _id != -1 ? edgeFromId(_id / 2) : INVALID; 471 469 } 472 470 … … 483 481 : nodes(), arcs() {} 484 482 485 typedef True NodeNumTag;486 typedef True EdgeNumTag;487 typedef True ArcNumTag;488 489 int nodeNum() const { return nodes.size(); }490 int edgeNum() const { return arcs.size() / 2; }491 int arcNum() const { return arcs.size(); }492 483 493 484 int maxNodeId() const { return nodes.size()-1; } … … 738 729 dir.push_back(arcFromId(n-1)); 739 730 Parent::notifier(Arc()).erase(dir); 740 nodes[arcs[n -1].target].first_out=arcs[n].next_out;741 nodes[arcs[n ].target].first_out=arcs[n-1].next_out;731 nodes[arcs[n].target].first_out=arcs[n].next_out; 732 nodes[arcs[n-1].target].first_out=arcs[n-1].next_out; 742 733 arcs.pop_back(); 743 734 arcs.pop_back();
Note: See TracChangeset
for help on using the changeset viewer.