diff -r a8081c9cd96a -r bb523a4758f7 lemon/graph_utils.h
--- a/lemon/graph_utils.h	Wed Nov 14 06:28:08 2007 +0000
+++ b/lemon/graph_utils.h	Wed Nov 14 15:36:37 2007 +0000
@@ -49,7 +49,7 @@
   ///\c OutEdgeIt
   ///\note If \c G it a template parameter, it should be used in this way.
   ///\code
-  ///  GRAPH_TYPEDEFS(typename G)
+  ///  GRAPH_TYPEDEFS(typename G);
   ///\endcode
   ///
   ///\warning There are no typedefs for the graph maps because of the lack of
@@ -60,7 +60,7 @@
     typedef Graph::   Edge      Edge;			\
     typedef Graph::   EdgeIt    EdgeIt;			\
     typedef Graph:: InEdgeIt  InEdgeIt;			\
-    typedef Graph::OutEdgeIt OutEdgeIt;			
+    typedef Graph::OutEdgeIt OutEdgeIt
 
   ///Creates convenience typedefs for the undirected graph types and iterators
 
@@ -70,16 +70,16 @@
   ///
   ///\note If \c G it a template parameter, it should be used in this way.
   ///\code
-  ///  UGRAPH_TYPEDEFS(typename G)
+  ///  UGRAPH_TYPEDEFS(typename G);
   ///\endcode
   ///
   ///\warning There are no typedefs for the graph maps because of the lack of
   ///template typedefs in C++.
 #define UGRAPH_TYPEDEFS(Graph)				\
-  GRAPH_TYPEDEFS(Graph)						\
+  GRAPH_TYPEDEFS(Graph);				\
     typedef Graph:: UEdge   UEdge;			\
     typedef Graph:: UEdgeIt UEdgeIt;			\
-    typedef Graph:: IncEdgeIt   IncEdgeIt;		       
+    typedef Graph:: IncEdgeIt   IncEdgeIt
 
   ///\brief Creates convenience typedefs for the bipartite undirected graph 
   ///types and iterators
@@ -90,17 +90,17 @@
   ///
   ///\note If \c G it a template parameter, it should be used in this way.
   ///\code
-  ///  BPUGRAPH_TYPEDEFS(typename G)
+  ///  BPUGRAPH_TYPEDEFS(typename G);
   ///\endcode
   ///
   ///\warning There are no typedefs for the graph maps because of the lack of
   ///template typedefs in C++.
 #define BPUGRAPH_TYPEDEFS(Graph)            \
-  UGRAPH_TYPEDEFS(Graph)                    \
+  UGRAPH_TYPEDEFS(Graph);		    \
     typedef Graph::ANode ANode;             \
     typedef Graph::BNode BNode;             \
     typedef Graph::ANodeIt ANodeIt;	    \
-    typedef Graph::BNodeIt BNodeIt;
+    typedef Graph::BNodeIt BNodeIt
 
   /// \brief Function to count the items in the graph.
   ///
@@ -2492,7 +2492,7 @@
   class EdgeLookUp 
   {
   public:
-    GRAPH_TYPEDEFS(typename G)
+    GRAPH_TYPEDEFS(typename G);
     typedef G Graph;
 
   protected:
@@ -2608,7 +2608,7 @@
     using EdgeLookUp<G>::_left;
     using EdgeLookUp<G>::_head;
 
-    GRAPH_TYPEDEFS(typename G)
+    GRAPH_TYPEDEFS(typename G);
     typedef G Graph;
     
     typename Graph::template EdgeMap<Edge> _next;