lemon/concepts/digraph.h
branch1.1
changeset 762 54abdfda0076
parent 572 2313edd0db0b
child 808 bdfc038f364c
equal deleted inserted replaced
9:bdced82c75af 10:8b0aa4095423
     1 /* -*- mode: C++; indent-tabs-mode: nil; -*-
     1 /* -*- mode: C++; indent-tabs-mode: nil; -*-
     2  *
     2  *
     3  * This file is a part of LEMON, a generic C++ optimization library.
     3  * This file is a part of LEMON, a generic C++ optimization library.
     4  *
     4  *
     5  * Copyright (C) 2003-2009
     5  * Copyright (C) 2003-2011
     6  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     6  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     7  * (Egervary Research Group on Combinatorial Optimization, EGRES).
     7  * (Egervary Research Group on Combinatorial Optimization, EGRES).
     8  *
     8  *
     9  * Permission to use, modify and distribute this software is granted
     9  * Permission to use, modify and distribute this software is granted
    10  * provided that this copyright notice appears in all copies. For
    10  * provided that this copyright notice appears in all copies. For
   433         ///\e
   433         ///\e
   434         NodeMap(const Digraph&, T) { }
   434         NodeMap(const Digraph&, T) { }
   435 
   435 
   436       private:
   436       private:
   437         ///Copy constructor
   437         ///Copy constructor
   438         NodeMap(const NodeMap& nm) : 
   438         NodeMap(const NodeMap& nm) :
   439           ReferenceMap<Node, T, T&, const T&>(nm) { }
   439           ReferenceMap<Node, T, T&, const T&>(nm) { }
   440         ///Assignment operator
   440         ///Assignment operator
   441         template <typename CMap>
   441         template <typename CMap>
   442         NodeMap& operator=(const CMap&) {
   442         NodeMap& operator=(const CMap&) {
   443           checkConcept<ReadMap<Node, T>, CMap>();
   443           checkConcept<ReadMap<Node, T>, CMap>();