1.1 --- a/lemon/concept/bpugraph.h Thu Feb 02 17:09:09 2006 +0000
1.2 +++ b/lemon/concept/bpugraph.h Thu Feb 02 17:43:24 2006 +0000
1.3 @@ -244,10 +244,10 @@
1.4 /// This iterator goes through each node.
1.5 /// Its usage is quite simple, for example you can count the number
1.6 /// of nodes in graph \c g of type \c Graph like this:
1.7 - /// \code
1.8 + ///\code
1.9 /// int count=0;
1.10 /// for (Graph::NodeIt n(g); n!=INVALID; ++n) ++count;
1.11 - /// \endcode
1.12 + ///\endcode
1.13 class NodeIt : public Node {
1.14 public:
1.15 /// Default constructor
1.16 @@ -289,10 +289,10 @@
1.17 /// This iterator goes through each ANode.
1.18 /// Its usage is quite simple, for example you can count the number
1.19 /// of nodes in graph \c g of type \c Graph like this:
1.20 - /// \code
1.21 + ///\code
1.22 /// int count=0;
1.23 /// for (Graph::ANodeIt n(g); n!=INVALID; ++n) ++count;
1.24 - /// \endcode
1.25 + ///\endcode
1.26 class ANodeIt : public ANode {
1.27 public:
1.28 /// Default constructor
1.29 @@ -334,10 +334,10 @@
1.30 /// This iterator goes through each BNode.
1.31 /// Its usage is quite simple, for example you can count the number
1.32 /// of nodes in graph \c g of type \c Graph like this:
1.33 - /// \code
1.34 + ///\code
1.35 /// int count=0;
1.36 /// for (Graph::BNodeIt n(g); n!=INVALID; ++n) ++count;
1.37 - /// \endcode
1.38 + ///\endcode
1.39 class BNodeIt : public BNode {
1.40 public:
1.41 /// Default constructor
1.42 @@ -425,10 +425,10 @@
1.43 /// This iterator goes through each undirected edge of a graph.
1.44 /// Its usage is quite simple, for example you can count the number
1.45 /// of undirected edges in a graph \c g of type \c Graph as follows:
1.46 - /// \code
1.47 + ///\code
1.48 /// int count=0;
1.49 /// for(Graph::UEdgeIt e(g); e!=INVALID; ++e) ++count;
1.50 - /// \endcode
1.51 + ///\endcode
1.52 class UEdgeIt : public UEdge {
1.53 public:
1.54 /// Default constructor
1.55 @@ -473,10 +473,10 @@
1.56 /// degree (i.e. count the number
1.57 /// of incident edges of a node \c n
1.58 /// in graph \c g of type \c Graph as follows.
1.59 - /// \code
1.60 + ///\code
1.61 /// int count=0;
1.62 /// for(Graph::IncEdgeIt e(g, n); e!=INVALID; ++e) ++count;
1.63 - /// \endcode
1.64 + ///\endcode
1.65 class IncEdgeIt : public UEdge {
1.66 public:
1.67 /// Default constructor
1.68 @@ -562,10 +562,10 @@
1.69 /// This iterator goes through each edge of a graph.
1.70 /// Its usage is quite simple, for example you can count the number
1.71 /// of edges in a graph \c g of type \c Graph as follows:
1.72 - /// \code
1.73 + ///\code
1.74 /// int count=0;
1.75 /// for(Graph::EdgeIt e(g); e!=INVALID; ++e) ++count;
1.76 - /// \endcode
1.77 + ///\endcode
1.78 class EdgeIt : public Edge {
1.79 public:
1.80 /// Default constructor
1.81 @@ -607,10 +607,10 @@
1.82 /// Its usage is quite simple, for example you can count the number
1.83 /// of outgoing edges of a node \c n
1.84 /// in graph \c g of type \c Graph as follows.
1.85 - /// \code
1.86 + ///\code
1.87 /// int count=0;
1.88 /// for (Graph::OutEdgeIt e(g, n); e!=INVALID; ++e) ++count;
1.89 - /// \endcode
1.90 + ///\endcode
1.91
1.92 class OutEdgeIt : public Edge {
1.93 public:
1.94 @@ -659,10 +659,10 @@
1.95 /// Its usage is quite simple, for example you can count the number
1.96 /// of outgoing edges of a node \c n
1.97 /// in graph \c g of type \c Graph as follows.
1.98 - /// \code
1.99 + ///\code
1.100 /// int count=0;
1.101 /// for(Graph::InEdgeIt e(g, n); e!=INVALID; ++e) ++count;
1.102 - /// \endcode
1.103 + ///\endcode
1.104
1.105 class InEdgeIt : public Edge {
1.106 public: