Changes in lemon/concepts/digraph.h [627:2313edd0db0b:263:be8a861d3bb7] in lemon
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/concepts/digraph.h
r627 r263 3 3 * This file is a part of LEMON, a generic C++ optimization library. 4 4 * 5 * Copyright (C) 2003-200 95 * Copyright (C) 2003-2008 6 6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport 7 7 * (Egervary Research Group on Combinatorial Optimization, EGRES). … … 17 17 */ 18 18 19 #ifndef LEMON_CONCEPT S_DIGRAPH_H20 #define LEMON_CONCEPT S_DIGRAPH_H19 #ifndef LEMON_CONCEPT_DIGRAPH_H 20 #define LEMON_CONCEPT_DIGRAPH_H 21 21 22 22 ///\ingroup graph_concepts … … 422 422 Node oppositeNode(const Node&, const Arc&) const { return INVALID; } 423 423 424 /// \brief Reference map of the nodes to type \c T. 425 /// 426 /// Reference map of the nodes to type \c T. 424 /// \brief Read write map of the nodes to type \c T. 425 /// 426 /// ReadWrite map of the nodes to type \c T. 427 /// \sa Reference 427 428 template<class T> 428 class NodeMap : public Re ferenceMap<Node, T, T&, const T&> {429 class NodeMap : public ReadWriteMap< Node, T > { 429 430 public: 430 431 … … 436 437 private: 437 438 ///Copy constructor 438 NodeMap(const NodeMap& nm) : 439 ReferenceMap<Node, T, T&, const T&>(nm) { } 439 NodeMap(const NodeMap& nm) : ReadWriteMap< Node, T >(nm) { } 440 440 ///Assignment operator 441 441 template <typename CMap> … … 446 446 }; 447 447 448 /// \brief Re ference map of the arcs to type \c T.448 /// \brief Read write map of the arcs to type \c T. 449 449 /// 450 450 /// Reference map of the arcs to type \c T. 451 /// \sa Reference 451 452 template<class T> 452 class ArcMap : public Re ferenceMap<Arc, T, T&, const T&> {453 class ArcMap : public ReadWriteMap<Arc,T> { 453 454 public: 454 455 … … 459 460 private: 460 461 ///Copy constructor 461 ArcMap(const ArcMap& em) : 462 ReferenceMap<Arc, T, T&, const T&>(em) { } 462 ArcMap(const ArcMap& em) : ReadWriteMap<Arc,T>(em) { } 463 463 ///Assignment operator 464 464 template <typename CMap> … … 472 472 struct Constraints { 473 473 void constraints() { 474 checkConcept<BaseDigraphComponent, _Digraph>();475 474 checkConcept<IterableDigraphComponent<>, _Digraph>(); 476 475 checkConcept<IDableDigraphComponent<>, _Digraph>(); … … 486 485 487 486 488 #endif 487 #endif // LEMON_CONCEPT_DIGRAPH_H
Note: See TracChangeset
for help on using the changeset viewer.