Changes in lemon/bits/graph_extender.h [220:a5d8c039f218:314:2cc60866a0c9] in lemon-main
- File:
-
- 1 edited
-
lemon/bits/graph_extender.h (modified) (9 diffs)
Legend:
- Unmodified
- Added
- Removed
-
lemon/bits/graph_extender.h
r220 r314 28 28 #include <lemon/concepts/maps.h> 29 29 30 // /\ingroup graphbits31 // /\file32 // /\brief Extenders for the digraph types30 //\ingroup graphbits 31 //\file 32 //\brief Extenders for the digraph types 33 33 namespace lemon { 34 34 35 // /\ingroup graphbits36 // /37 // /\brief Extender for the Digraphs35 // \ingroup graphbits 36 // 37 // \brief Extender for the Digraphs 38 38 template <typename Base> 39 39 class DigraphExtender : public Base { … … 187 187 }; 188 188 189 // /\brief Base node of the iterator190 // /191 // /Returns the base node (i.e. the source in this case) of the iterator189 // \brief Base node of the iterator 190 // 191 // Returns the base node (i.e. the source in this case) of the iterator 192 192 Node baseNode(const OutArcIt &arc) const { 193 193 return Parent::source(arc); 194 194 } 195 // /\brief Running node of the iterator196 // /197 // /Returns the running node (i.e. the target in this case) of the198 // /iterator195 // \brief Running node of the iterator 196 // 197 // Returns the running node (i.e. the target in this case) of the 198 // iterator 199 199 Node runningNode(const OutArcIt &arc) const { 200 200 return Parent::target(arc); 201 201 } 202 202 203 // /\brief Base node of the iterator204 // /205 // /Returns the base node (i.e. the target in this case) of the iterator203 // \brief Base node of the iterator 204 // 205 // Returns the base node (i.e. the target in this case) of the iterator 206 206 Node baseNode(const InArcIt &arc) const { 207 207 return Parent::target(arc); 208 208 } 209 // /\brief Running node of the iterator210 // /211 // /Returns the running node (i.e. the source in this case) of the212 // /iterator209 // \brief Running node of the iterator 210 // 211 // Returns the running node (i.e. the source in this case) of the 212 // iterator 213 213 Node runningNode(const InArcIt &arc) const { 214 214 return Parent::source(arc); … … 228 228 : Parent(digraph, value) {} 229 229 230 private: 230 231 NodeMap& operator=(const NodeMap& cmap) { 231 232 return operator=<NodeMap>(cmap); … … 252 253 : Parent(digraph, value) {} 253 254 255 private: 254 256 ArcMap& operator=(const ArcMap& cmap) { 255 257 return operator=<ArcMap>(cmap); … … 324 326 }; 325 327 326 // /\ingroup _graphbits327 // /328 // /\brief Extender for the Graphs328 // \ingroup _graphbits 329 // 330 // \brief Extender for the Graphs 329 331 template <typename Base> 330 332 class GraphExtender : public Base { … … 554 556 }; 555 557 556 // /\brief Base node of the iterator557 // /558 // /Returns the base node (ie. the source in this case) of the iterator558 // \brief Base node of the iterator 559 // 560 // Returns the base node (ie. the source in this case) of the iterator 559 561 Node baseNode(const OutArcIt &arc) const { 560 562 return Parent::source(static_cast<const Arc&>(arc)); 561 563 } 562 // /\brief Running node of the iterator563 // /564 // /Returns the running node (ie. the target in this case) of the565 // /iterator564 // \brief Running node of the iterator 565 // 566 // Returns the running node (ie. the target in this case) of the 567 // iterator 566 568 Node runningNode(const OutArcIt &arc) const { 567 569 return Parent::target(static_cast<const Arc&>(arc)); 568 570 } 569 571 570 // /\brief Base node of the iterator571 // /572 // /Returns the base node (ie. the target in this case) of the iterator572 // \brief Base node of the iterator 573 // 574 // Returns the base node (ie. the target in this case) of the iterator 573 575 Node baseNode(const InArcIt &arc) const { 574 576 return Parent::target(static_cast<const Arc&>(arc)); 575 577 } 576 // /\brief Running node of the iterator577 // /578 // /Returns the running node (ie. the source in this case) of the579 // /iterator578 // \brief Running node of the iterator 579 // 580 // Returns the running node (ie. the source in this case) of the 581 // iterator 580 582 Node runningNode(const InArcIt &arc) const { 581 583 return Parent::source(static_cast<const Arc&>(arc)); 582 584 } 583 585 584 // /Base node of the iterator585 // /586 // /Returns the base node of the iterator586 // Base node of the iterator 587 // 588 // Returns the base node of the iterator 587 589 Node baseNode(const IncEdgeIt &edge) const { 588 590 return edge._direction ? u(edge) : v(edge); 589 591 } 590 // /Running node of the iterator591 // /592 // /Returns the running node of the iterator592 // Running node of the iterator 593 // 594 // Returns the running node of the iterator 593 595 Node runningNode(const IncEdgeIt &edge) const { 594 596 return edge._direction ? v(edge) : u(edge); … … 609 611 : Parent(graph, value) {} 610 612 613 private: 611 614 NodeMap& operator=(const NodeMap& cmap) { 612 615 return operator=<NodeMap>(cmap); … … 633 636 : Parent(graph, value) {} 634 637 638 private: 635 639 ArcMap& operator=(const ArcMap& cmap) { 636 640 return operator=<ArcMap>(cmap); … … 658 662 : Parent(graph, value) {} 659 663 664 private: 660 665 EdgeMap& operator=(const EdgeMap& cmap) { 661 666 return operator=<EdgeMap>(cmap);
Note: See TracChangeset
for help on using the changeset viewer.
