# HG changeset patch
# User Peter Kovacs <kpeter@inf.elte.hu>
# Date 1223461209 7200
# Node ID 8c05947fc107554c05a46c8480e0df090e46a7c3
# Parent 907446600ca9618c543cd9ba27d594bf79fe2dba
Revert faulty changes of [dc9e8d2c0df9]
diff git a/lemon/core.h b/lemon/core.h
a

b


58  58  /// \addtogroup gutils 
59  59  /// @{ 
60  60  
61   ///Create convenient typedefs for the digraph types and iterators 
 61  ///Create convenience typedefs for the digraph types and iterators 
62  62  
63  63  ///This \c \#define creates convenient type definitions for the following 
64  64  ///types of \c Digraph: \c Node, \c NodeIt, \c Arc, \c ArcIt, \c InArcIt, 
… 
… 

80  80  typedef Digraph::NodeMap<double> DoubleNodeMap; \ 
81  81  typedef Digraph::ArcMap<bool> BoolArcMap; \ 
82  82  typedef Digraph::ArcMap<int> IntArcMap; \ 
83   typedef Digraph::ArcMap<double> DoubleArcMap; 
 83  typedef Digraph::ArcMap<double> DoubleArcMap 
84  84  
85   ///Create convenient typedefs for the digraph types and iterators 
 85  ///Create convenience typedefs for the digraph types and iterators 
86  86  
87  87  ///\see DIGRAPH_TYPEDEFS 
88  88  /// 
… 
… 

100  100  typedef typename Digraph::template NodeMap<double> DoubleNodeMap; \ 
101  101  typedef typename Digraph::template ArcMap<bool> BoolArcMap; \ 
102  102  typedef typename Digraph::template ArcMap<int> IntArcMap; \ 
103   typedef typename Digraph::template ArcMap<double> DoubleArcMap; 
 103  typedef typename Digraph::template ArcMap<double> DoubleArcMap 
104  104  
105   ///Create convenient typedefs for the graph types and iterators 
 105  ///Create convenience typedefs for the graph types and iterators 
106  106  
107  107  ///This \c \#define creates the same convenient type definitions as defined 
108  108  ///by \ref DIGRAPH_TYPEDEFS(Graph) and six more, namely it creates 
… 
… 

119  119  typedef Graph::IncEdgeIt IncEdgeIt; \ 
120  120  typedef Graph::EdgeMap<bool> BoolEdgeMap; \ 
121  121  typedef Graph::EdgeMap<int> IntEdgeMap; \ 
122   typedef Graph::EdgeMap<double> DoubleEdgeMap; 
 122  typedef Graph::EdgeMap<double> DoubleEdgeMap 
123  123  
124   ///Create convenient typedefs for the graph types and iterators 
 124  ///Create convenience typedefs for the graph types and iterators 
125  125  
126  126  ///\see GRAPH_TYPEDEFS 
127  127  /// 
… 
… 

134  134  typedef typename Graph::IncEdgeIt IncEdgeIt; \ 
135  135  typedef typename Graph::template EdgeMap<bool> BoolEdgeMap; \ 
136  136  typedef typename Graph::template EdgeMap<int> IntEdgeMap; \ 
137   typedef typename Graph::template EdgeMap<double> DoubleEdgeMap; 
 137  typedef typename Graph::template EdgeMap<double> DoubleEdgeMap 
138  138  
139  139  /// \brief Function to count the items in a graph. 
140  140  /// 