1.1 --- a/benchmark/edge_lookup.cc	Wed Nov 14 06:28:08 2007 +0000
     1.2 +++ b/benchmark/edge_lookup.cc	Wed Nov 14 15:36:37 2007 +0000
     1.3 @@ -29,7 +29,7 @@
     1.4    class EdgeLookUp2
     1.5    {
     1.6    public:
     1.7 -    GRAPH_TYPEDEFS(typename G)
     1.8 +    GRAPH_TYPEDEFS(typename G);
     1.9      typedef G Graph;
    1.10  
    1.11    private:
    1.12 @@ -107,7 +107,7 @@
    1.13    class EdgeLookUp3
    1.14    {
    1.15    public:
    1.16 -    GRAPH_TYPEDEFS(typename G)
    1.17 +    GRAPH_TYPEDEFS(typename G);
    1.18      typedef G Graph;
    1.19  
    1.20    private:
    1.21 @@ -194,7 +194,7 @@
    1.22  //   class EdgeLookUp4
    1.23  //   {
    1.24  //   public:
    1.25 -//     GRAPH_TYPEDEFS(typename G)
    1.26 +//     GRAPH_TYPEDEFS(typename G);
    1.27  //     typedef G Graph;
    1.28      
    1.29  //   private:
    1.30 @@ -287,7 +287,7 @@
    1.31  //   class EdgeLookUp5
    1.32  //   {
    1.33  //   public:
    1.34 -//     GRAPH_TYPEDEFS(typename G)
    1.35 +//     GRAPH_TYPEDEFS(typename G);
    1.36  //     typedef G Graph;
    1.37      
    1.38  //   private:
    1.39 @@ -377,7 +377,7 @@
    1.40        
    1.41  //   };
    1.42  
    1.43 -GRAPH_TYPEDEFS(SmartGraph)
    1.44 +GRAPH_TYPEDEFS(SmartGraph);
    1.45  typedef SmartGraph Graph;
    1.46  
    1.47  class FE 

     2.1 --- a/demo/graph_orientation.cc	Wed Nov 14 06:28:08 2007 +0000
     2.2 +++ b/demo/graph_orientation.cc	Wed Nov 14 15:36:37 2007 +0000
     2.3 @@ -25,7 +25,7 @@
     2.4  
     2.5  using namespace lemon;
     2.6   
     2.7 -GRAPH_TYPEDEFS(ListGraph)
     2.8 +GRAPH_TYPEDEFS(ListGraph);
     2.9  
    2.10  int main(int argc, char** argv) 
    2.11  {

     3.1 --- a/demo/strongly_connected_orientation.cc	Wed Nov 14 06:28:08 2007 +0000
     3.2 +++ b/demo/strongly_connected_orientation.cc	Wed Nov 14 15:36:37 2007 +0000
     3.3 @@ -42,7 +42,7 @@
     3.4  using namespace std;
     3.5  
     3.6  typedef SmartUGraph UGraph;
     3.7 -UGRAPH_TYPEDEFS(UGraph)
     3.8 +UGRAPH_TYPEDEFS(UGraph);
     3.9  
    3.10  Color color(bool c) {
    3.11    return c ? BLACK : RED;

     4.1 --- a/lemon/graph_utils.h	Wed Nov 14 06:28:08 2007 +0000
     4.2 +++ b/lemon/graph_utils.h	Wed Nov 14 15:36:37 2007 +0000
     4.3 @@ -49,7 +49,7 @@
     4.4    ///\c OutEdgeIt
     4.5    ///\note If \c G it a template parameter, it should be used in this way.
     4.6    ///\code
     4.7 -  ///  GRAPH_TYPEDEFS(typename G)
     4.8 +  ///  GRAPH_TYPEDEFS(typename G);
     4.9    ///\endcode
    4.10    ///
    4.11    ///\warning There are no typedefs for the graph maps because of the lack of
    4.12 @@ -60,7 +60,7 @@
    4.13      typedef Graph::   Edge      Edge;			\
    4.14      typedef Graph::   EdgeIt    EdgeIt;			\
    4.15      typedef Graph:: InEdgeIt  InEdgeIt;			\
    4.16 -    typedef Graph::OutEdgeIt OutEdgeIt;			
    4.17 +    typedef Graph::OutEdgeIt OutEdgeIt
    4.18  
    4.19    ///Creates convenience typedefs for the undirected graph types and iterators
    4.20  
    4.21 @@ -70,16 +70,16 @@
    4.22    ///
    4.23    ///\note If \c G it a template parameter, it should be used in this way.
    4.24    ///\code
    4.25 -  ///  UGRAPH_TYPEDEFS(typename G)
    4.26 +  ///  UGRAPH_TYPEDEFS(typename G);
    4.27    ///\endcode
    4.28    ///
    4.29    ///\warning There are no typedefs for the graph maps because of the lack of
    4.30    ///template typedefs in C++.
    4.31  #define UGRAPH_TYPEDEFS(Graph)				\
    4.32 -  GRAPH_TYPEDEFS(Graph)						\
    4.33 +  GRAPH_TYPEDEFS(Graph);				\
    4.34      typedef Graph:: UEdge   UEdge;			\
    4.35      typedef Graph:: UEdgeIt UEdgeIt;			\
    4.36 -    typedef Graph:: IncEdgeIt   IncEdgeIt;		       
    4.37 +    typedef Graph:: IncEdgeIt   IncEdgeIt
    4.38  
    4.39    ///\brief Creates convenience typedefs for the bipartite undirected graph 
    4.40    ///types and iterators
    4.41 @@ -90,17 +90,17 @@
    4.42    ///
    4.43    ///\note If \c G it a template parameter, it should be used in this way.
    4.44    ///\code
    4.45 -  ///  BPUGRAPH_TYPEDEFS(typename G)
    4.46 +  ///  BPUGRAPH_TYPEDEFS(typename G);
    4.47    ///\endcode
    4.48    ///
    4.49    ///\warning There are no typedefs for the graph maps because of the lack of
    4.50    ///template typedefs in C++.
    4.51  #define BPUGRAPH_TYPEDEFS(Graph)            \
    4.52 -  UGRAPH_TYPEDEFS(Graph)                    \
    4.53 +  UGRAPH_TYPEDEFS(Graph);		    \
    4.54      typedef Graph::ANode ANode;             \
    4.55      typedef Graph::BNode BNode;             \
    4.56      typedef Graph::ANodeIt ANodeIt;	    \
    4.57 -    typedef Graph::BNodeIt BNodeIt;
    4.58 +    typedef Graph::BNodeIt BNodeIt
    4.59  
    4.60    /// \brief Function to count the items in the graph.
    4.61    ///
    4.62 @@ -2492,7 +2492,7 @@
    4.63    class EdgeLookUp 
    4.64    {
    4.65    public:
    4.66 -    GRAPH_TYPEDEFS(typename G)
    4.67 +    GRAPH_TYPEDEFS(typename G);
    4.68      typedef G Graph;
    4.69  
    4.70    protected:
    4.71 @@ -2608,7 +2608,7 @@
    4.72      using EdgeLookUp<G>::_left;
    4.73      using EdgeLookUp<G>::_head;
    4.74  
    4.75 -    GRAPH_TYPEDEFS(typename G)
    4.76 +    GRAPH_TYPEDEFS(typename G);
    4.77      typedef G Graph;
    4.78      
    4.79      typename Graph::template EdgeMap<Edge> _next;

     5.1 --- a/lemon/steiner.h	Wed Nov 14 06:28:08 2007 +0000
     5.2 +++ b/lemon/steiner.h	Wed Nov 14 15:36:37 2007 +0000
     5.3 @@ -55,7 +55,7 @@
     5.4    class SteinerTree {
     5.5    public:
     5.6      
     5.7 -    UGRAPH_TYPEDEFS(typename UGraph)
     5.8 +    UGRAPH_TYPEDEFS(typename UGraph);
     5.9  
    5.10      typedef typename CostMap::Value Value;
    5.11