Changeset 1946:17eb3eaad9f8 in lemon-0.x for lemon/concept/bpugraph.h

Timestamp:

02/02/06 18:43:24 (18 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2521

Message:

• workaround for a Doxygen 1.4.6 bug
• other doc fixes

File:

• lemon/concept/bpugraph.h (modified) (8 diffs)

lemon/concept/bpugraph.h

@@ -245 +245 @@
       /// Its usage is quite simple, for example you can count the number
       /// of nodes in graph \c g of type \c Graph like this:
-      /// \code
+      ///\code
       /// int count=0;
       /// for (Graph::NodeIt n(g); n!=INVALID; ++n) ++count;
-      /// \endcode
+      ///\endcode
       class NodeIt : public Node {
       public:
@@ -290 +290 @@
       /// Its usage is quite simple, for example you can count the number
       /// of nodes in graph \c g of type \c Graph like this:
-      /// \code
+      ///\code
       /// int count=0;
       /// for (Graph::ANodeIt n(g); n!=INVALID; ++n) ++count;
-      /// \endcode
+      ///\endcode
       class ANodeIt : public ANode {
       public:
@@ -335 +335 @@
       /// Its usage is quite simple, for example you can count the number
       /// of nodes in graph \c g of type \c Graph like this:
-      /// \code
+      ///\code
       /// int count=0;
       /// for (Graph::BNodeIt n(g); n!=INVALID; ++n) ++count;
-      /// \endcode
+      ///\endcode
       class BNodeIt : public BNode {
       public:
@@ -426 +426 @@
       /// Its usage is quite simple, for example you can count the number
       /// of undirected edges in a graph \c g of type \c Graph as follows:
-      /// \code
+      ///\code
       /// int count=0;
       /// for(Graph::UEdgeIt e(g); e!=INVALID; ++e) ++count;
-      /// \endcode
+      ///\endcode
       class UEdgeIt : public UEdge {
       public:
@@ -474 +474 @@
       /// of incident edges of a node \c n
       /// in graph \c g of type \c Graph as follows.
-      /// \code
+      ///\code
       /// int count=0;
       /// for(Graph::IncEdgeIt e(g, n); e!=INVALID; ++e) ++count;
-      /// \endcode
+      ///\endcode
       class IncEdgeIt : public UEdge {
       public:
@@ -563 +563 @@
       /// Its usage is quite simple, for example you can count the number
       /// of edges in a graph \c g of type \c Graph as follows:
-      /// \code
+      ///\code
       /// int count=0;
       /// for(Graph::EdgeIt e(g); e!=INVALID; ++e) ++count;
-      /// \endcode
+      ///\endcode
       class EdgeIt : public Edge {
       public:
@@ -608 +608 @@
       /// of outgoing edges of a node \c n
       /// in graph \c g of type \c Graph as follows.
-      /// \code
+      ///\code
       /// int count=0;
       /// for (Graph::OutEdgeIt e(g, n); e!=INVALID; ++e) ++count;
-      /// \endcode
+      ///\endcode
     
       class OutEdgeIt : public Edge {
@@ -660 +660 @@
       /// of outgoing edges of a node \c n
       /// in graph \c g of type \c Graph as follows.
-      /// \code
+      ///\code
       /// int count=0;
       /// for(Graph::InEdgeIt e(g, n); e!=INVALID; ++e) ++count;
-      /// \endcode
+      ///\endcode
 
       class InEdgeIt : public Edge {