gravatar
deba@inf.elte.hu
deba@inf.elte.hu
Fix bug #26 (UndirectedTagIndicator<> does not work)
0 1 0
default
1 file changed with 3 insertions and 0 deletions:
↑ Collapse diff ↑
Ignore white space 24 line context
... ...
@@ -11,24 +11,25 @@
11 11
 * precise terms see the accompanying LICENSE file.
12 12
 *
13 13
 * This software is provided "AS IS" with no warranty of any kind,
14 14
 * express or implied, and with no claim as to its suitability for any
15 15
 * purpose.
16 16
 *
17 17
 */
18 18

	
19 19
#ifndef LEMON_BITS_GRAPH_EXTENDER_H
20 20
#define LEMON_BITS_GRAPH_EXTENDER_H
21 21

	
22 22
#include <lemon/bits/invalid.h>
23
#include <lemon/bits/utility.h>
23 24

	
24 25
#include <lemon/bits/map_extender.h>
25 26
#include <lemon/bits/default_map.h>
26 27

	
27 28
#include <lemon/concept_check.h>
28 29
#include <lemon/concepts/maps.h>
29 30

	
30 31
///\ingroup graphbits
31 32
///\file
32 33
///\brief Extenders for the digraph types
33 34
namespace lemon {
34 35

	
... ...
@@ -324,24 +325,26 @@
324 325
  };
325 326

	
326 327
  /// \ingroup graphbits
327 328
  ///
328 329
  /// \brief Extender for the Graphs
329 330
  template <typename Base> 
330 331
  class GraphExtender : public Base {
331 332
  public:
332 333
    
333 334
    typedef Base Parent;
334 335
    typedef GraphExtender Digraph;
335 336

	
337
    typedef True UndirectedTag;
338

	
336 339
    typedef typename Parent::Node Node;
337 340
    typedef typename Parent::Arc Arc;
338 341
    typedef typename Parent::Edge Edge;
339 342

	
340 343
    // Graph extension    
341 344

	
342 345
    int maxId(Node) const {
343 346
      return Parent::maxNodeId();
344 347
    }
345 348

	
346 349
    int maxId(Arc) const {
347 350
      return Parent::maxArcId();
0 comments (0 inline)