1.1 --- a/lemon/graph_utils.h Wed Nov 14 06:28:08 2007 +0000
1.2 +++ b/lemon/graph_utils.h Wed Nov 14 15:36:37 2007 +0000
1.3 @@ -49,7 +49,7 @@
1.4 ///\c OutEdgeIt
1.5 ///\note If \c G it a template parameter, it should be used in this way.
1.6 ///\code
1.7 - /// GRAPH_TYPEDEFS(typename G)
1.8 + /// GRAPH_TYPEDEFS(typename G);
1.9 ///\endcode
1.10 ///
1.11 ///\warning There are no typedefs for the graph maps because of the lack of
1.12 @@ -60,7 +60,7 @@
1.13 typedef Graph:: Edge Edge; \
1.14 typedef Graph:: EdgeIt EdgeIt; \
1.15 typedef Graph:: InEdgeIt InEdgeIt; \
1.16 - typedef Graph::OutEdgeIt OutEdgeIt;
1.17 + typedef Graph::OutEdgeIt OutEdgeIt
1.18
1.19 ///Creates convenience typedefs for the undirected graph types and iterators
1.20
1.21 @@ -70,16 +70,16 @@
1.22 ///
1.23 ///\note If \c G it a template parameter, it should be used in this way.
1.24 ///\code
1.25 - /// UGRAPH_TYPEDEFS(typename G)
1.26 + /// UGRAPH_TYPEDEFS(typename G);
1.27 ///\endcode
1.28 ///
1.29 ///\warning There are no typedefs for the graph maps because of the lack of
1.30 ///template typedefs in C++.
1.31 #define UGRAPH_TYPEDEFS(Graph) \
1.32 - GRAPH_TYPEDEFS(Graph) \
1.33 + GRAPH_TYPEDEFS(Graph); \
1.34 typedef Graph:: UEdge UEdge; \
1.35 typedef Graph:: UEdgeIt UEdgeIt; \
1.36 - typedef Graph:: IncEdgeIt IncEdgeIt;
1.37 + typedef Graph:: IncEdgeIt IncEdgeIt
1.38
1.39 ///\brief Creates convenience typedefs for the bipartite undirected graph
1.40 ///types and iterators
1.41 @@ -90,17 +90,17 @@
1.42 ///
1.43 ///\note If \c G it a template parameter, it should be used in this way.
1.44 ///\code
1.45 - /// BPUGRAPH_TYPEDEFS(typename G)
1.46 + /// BPUGRAPH_TYPEDEFS(typename G);
1.47 ///\endcode
1.48 ///
1.49 ///\warning There are no typedefs for the graph maps because of the lack of
1.50 ///template typedefs in C++.
1.51 #define BPUGRAPH_TYPEDEFS(Graph) \
1.52 - UGRAPH_TYPEDEFS(Graph) \
1.53 + UGRAPH_TYPEDEFS(Graph); \
1.54 typedef Graph::ANode ANode; \
1.55 typedef Graph::BNode BNode; \
1.56 typedef Graph::ANodeIt ANodeIt; \
1.57 - typedef Graph::BNodeIt BNodeIt;
1.58 + typedef Graph::BNodeIt BNodeIt
1.59
1.60 /// \brief Function to count the items in the graph.
1.61 ///
1.62 @@ -2492,7 +2492,7 @@
1.63 class EdgeLookUp
1.64 {
1.65 public:
1.66 - GRAPH_TYPEDEFS(typename G)
1.67 + GRAPH_TYPEDEFS(typename G);
1.68 typedef G Graph;
1.69
1.70 protected:
1.71 @@ -2608,7 +2608,7 @@
1.72 using EdgeLookUp<G>::_left;
1.73 using EdgeLookUp<G>::_head;
1.74
1.75 - GRAPH_TYPEDEFS(typename G)
1.76 + GRAPH_TYPEDEFS(typename G);
1.77 typedef G Graph;
1.78
1.79 typename Graph::template EdgeMap<Edge> _next;