COIN-OR::LEMON - Graph Library

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


Ignore:
Timestamp:
02/02/06 18:43:24 (14 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:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/concept/ugraph.h

    r1910 r1946  
    305305      /// Its usage is quite simple, for example you can count the number
    306306      /// of nodes in graph \c g of type \c Graph like this:
    307       /// \code
     307      ///\code
    308308      /// int count=0;
    309309      /// for (Graph::NodeIt n(g); n!=INVALID; ++n) ++count;
    310       /// \endcode
     310      ///\endcode
    311311      class NodeIt : public Node {
    312312      public:
     
    396396      /// Its usage is quite simple, for example you can count the number
    397397      /// of undirected edges in a graph \c g of type \c Graph as follows:
    398       /// \code
     398      ///\code
    399399      /// int count=0;
    400400      /// for(Graph::UEdgeIt e(g); e!=INVALID; ++e) ++count;
    401       /// \endcode
     401      ///\endcode
    402402      class UEdgeIt : public UEdge {
    403403      public:
     
    444444      /// of incident edges of a node \c n
    445445      /// in graph \c g of type \c Graph as follows.
    446       /// \code
     446      ///\code
    447447      /// int count=0;
    448448      /// for(Graph::IncEdgeIt e(g, n); e!=INVALID; ++e) ++count;
    449       /// \endcode
     449      ///\endcode
    450450      class IncEdgeIt : public UEdge {
    451451      public:
     
    533533      /// Its usage is quite simple, for example you can count the number
    534534      /// of edges in a graph \c g of type \c Graph as follows:
    535       /// \code
     535      ///\code
    536536      /// int count=0;
    537537      /// for(Graph::EdgeIt e(g); e!=INVALID; ++e) ++count;
    538       /// \endcode
     538      ///\endcode
    539539      class EdgeIt : public Edge {
    540540      public:
     
    578578      /// of outgoing edges of a node \c n
    579579      /// in graph \c g of type \c Graph as follows.
    580       /// \code
     580      ///\code
    581581      /// int count=0;
    582582      /// for (Graph::OutEdgeIt e(g, n); e!=INVALID; ++e) ++count;
    583       /// \endcode
     583      ///\endcode
    584584   
    585585      class OutEdgeIt : public Edge {
     
    630630      /// of outgoing edges of a node \c n
    631631      /// in graph \c g of type \c Graph as follows.
    632       /// \code
     632      ///\code
    633633      /// int count=0;
    634634      /// for(Graph::InEdgeIt e(g, n); e!=INVALID; ++e) ++count;
    635       /// \endcode
     635      ///\endcode
    636636
    637637      class InEdgeIt : public Edge {
Note: See TracChangeset for help on using the changeset viewer.