COIN-OR::LEMON - Graph Library

Ticket #159: 8c05947fc107.patch

File 8c05947fc107.patch, 2.7 KB (added by Peter Kovacs, 12 years ago)
  • lemon/core.h

    # 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  
    5858  /// \addtogroup gutils
    5959  /// @{
    6060
    61   ///Create convenient typedefs for the digraph types and iterators
     61  ///Create convenience typedefs for the digraph types and iterators
    6262
    6363  ///This \c \#define creates convenient type definitions for the following
    6464  ///types of \c Digraph: \c Node,  \c NodeIt, \c Arc, \c ArcIt, \c InArcIt,
     
    8080  typedef Digraph::NodeMap<double> DoubleNodeMap;                       \
    8181  typedef Digraph::ArcMap<bool> BoolArcMap;                             \
    8282  typedef Digraph::ArcMap<int> IntArcMap;                               \
    83   typedef Digraph::ArcMap<double> DoubleArcMap;
     83  typedef Digraph::ArcMap<double> DoubleArcMap
    8484
    85   ///Create convenient typedefs for the digraph types and iterators
     85  ///Create convenience typedefs for the digraph types and iterators
    8686
    8787  ///\see DIGRAPH_TYPEDEFS
    8888  ///
     
    100100  typedef typename Digraph::template NodeMap<double> DoubleNodeMap;     \
    101101  typedef typename Digraph::template ArcMap<bool> BoolArcMap;           \
    102102  typedef typename Digraph::template ArcMap<int> IntArcMap;             \
    103   typedef typename Digraph::template ArcMap<double> DoubleArcMap;
     103  typedef typename Digraph::template ArcMap<double> DoubleArcMap
    104104
    105   ///Create convenient typedefs for the graph types and iterators
     105  ///Create convenience typedefs for the graph types and iterators
    106106
    107107  ///This \c \#define creates the same convenient type definitions as defined
    108108  ///by \ref DIGRAPH_TYPEDEFS(Graph) and six more, namely it creates
     
    119119  typedef Graph::IncEdgeIt IncEdgeIt;                                   \
    120120  typedef Graph::EdgeMap<bool> BoolEdgeMap;                             \
    121121  typedef Graph::EdgeMap<int> IntEdgeMap;                               \
    122   typedef Graph::EdgeMap<double> DoubleEdgeMap;
     122  typedef Graph::EdgeMap<double> DoubleEdgeMap
    123123
    124   ///Create convenient typedefs for the graph types and iterators
     124  ///Create convenience typedefs for the graph types and iterators
    125125
    126126  ///\see GRAPH_TYPEDEFS
    127127  ///
     
    134134  typedef typename Graph::IncEdgeIt IncEdgeIt;                          \
    135135  typedef typename Graph::template EdgeMap<bool> BoolEdgeMap;           \
    136136  typedef typename Graph::template EdgeMap<int> IntEdgeMap;             \
    137   typedef typename Graph::template EdgeMap<double> DoubleEdgeMap;
     137  typedef typename Graph::template EdgeMap<double> DoubleEdgeMap
    138138
    139139  /// \brief Function to count the items in a graph.
    140140  ///