Changeset 300:8c05947fc107 in lemon for lemon/core.h
 Timestamp:
 10/08/08 12:20:09 (13 years ago)
 Branch:
 default
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/core.h
r282 r300 59 59 /// @{ 60 60 61 ///Create convenien ttypedefs for the digraph types and iterators61 ///Create convenience typedefs for the digraph types and iterators 62 62 63 63 ///This \c \#define creates convenient type definitions for the following … … 81 81 typedef Digraph::ArcMap<bool> BoolArcMap; \ 82 82 typedef Digraph::ArcMap<int> IntArcMap; \ 83 typedef Digraph::ArcMap<double> DoubleArcMap ;84 85 ///Create convenien ttypedefs for the digraph types and iterators83 typedef Digraph::ArcMap<double> DoubleArcMap 84 85 ///Create convenience typedefs for the digraph types and iterators 86 86 87 87 ///\see DIGRAPH_TYPEDEFS … … 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 ;104 105 ///Create convenien ttypedefs for the graph types and iterators103 typedef typename Digraph::template ArcMap<double> DoubleArcMap 104 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 … … 120 120 typedef Graph::EdgeMap<bool> BoolEdgeMap; \ 121 121 typedef Graph::EdgeMap<int> IntEdgeMap; \ 122 typedef Graph::EdgeMap<double> DoubleEdgeMap ;123 124 ///Create convenien ttypedefs for the graph types and iterators122 typedef Graph::EdgeMap<double> DoubleEdgeMap 123 124 ///Create convenience typedefs for the graph types and iterators 125 125 126 126 ///\see GRAPH_TYPEDEFS … … 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.
Note: See TracChangeset
for help on using the changeset viewer.