COIN-OR::LEMON - Graph Library

Changeset 1527:7ceab500e1f6 in lemon-0.x for lemon/concept


Ignore:
Timestamp:
07/01/05 12:33:27 (19 years ago)
Author:
athos
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2014
Message:

Doc review+corrections in my own documentation according to the reviewers comments.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/concept/sym_graph.h

    r1526 r1527  
    4343    /// or it can serve as a skeleton of a new symmetric graph structure.
    4444    ///
    45     /// Also, you will find here the full documentation of a certain graph
    46     /// feature, the documentation of a real symmetric graph imlementation
     45    /// Also, you will find here the full documentation of graph
     46    /// features, the documentation of a real symmetric graph imlementation
    4747    /// like @ref SymListGraph or
    4848    /// @ref lemon::SymSmartGraph will just refer to this structure.
     
    5555      ///
    5656      StaticSymGraph() { }
    57       ///Copy consructor.
     57      //      ///Copy consructor.
    5858
    5959//       ///\todo It is not clear, what we expect from a copy constructor.
     
    9494        /// Inequality operator
    9595       
    96         /// \sa operator==(Node n)
     96        /// \sa operator==(Node)
    9797        ///
    9898        bool operator!=(Node) const { return true; }
     
    142142
    143143        /// Sets the iterator to the node of \c g pointed by the trivial
    144         /// iterator n.
     144        /// iterator \c n.
    145145        /// This feature necessitates that each time we
    146         /// iterate the edge-set, the iteration order is the same.
     146        /// iterate the node-set, the iteration order is the same.
    147147        NodeIt(const StaticSymGraph& g, const Node& n) { }
    148148        /// Next node.
     
    268268        /// This constructor sets the iterator to first outgoing edge.
    269269   
    270         /// This constructor set the iterator to the first outgoing edge of
    271         /// node
     270        /// This constructor sets the iterator to the first outgoing edge of
     271        /// the node
    272272        ///@param n the node
    273273        ///@param g the graph
     
    317317        /// This constructor sets the iterator to first incoming edge.
    318318   
    319         /// This constructor set the iterator to the first incoming edge of
    320         /// node
     319        /// This constructor sets the iterator to the first incoming edge of
     320        /// the node
    321321        ///@param n the node
    322322        ///@param g the graph
     
    362362        /// This constructor sets the iterator to first edge.
    363363   
    364         /// This constructor set the iterator to the first edge of
    365         /// node
     364        /// This constructor sets the iterator to the first edge of
     365        /// the graph
    366366        ///@param g the graph
    367367        SymEdgeIt(const StaticSymGraph& g) { }
     
    406406        /// This constructor sets the iterator to first edge.
    407407   
    408         /// This constructor set the iterator to the first edge of
    409         /// node
     408        /// This constructor sets the iterator to the first edge of
     409        /// the graph
    410410        ///@param g the graph
    411411        EdgeIt(const StaticSymGraph& g) { }
     
    590590    /// An empty non-static graph class.
    591591
    592     /// This class provides everything that \ref StaticGraph
    593     /// with additional functionality which enables to build a
     592    /// This class is an extension of \ref StaticGraph
     593    /// with additional functionality that enables one to build a
    594594    /// graph from scratch.
    595     class ExtendableSymGraph : public StaticSymGraph
     595     class ExtendableSymGraph : public StaticSymGraph
    596596    {
    597597    public:
     
    623623    /// An empty erasable graph class.
    624624 
    625     /// This class is an extension of \ref ExtendableGraph. It also makes it
    626     /// possible to erase edges or nodes.
     625    /// This class is an extension of \ref ExtendableGraph. It is also
     626    /// possible to erase edges or nodes in this graph.
    627627    class ErasableSymGraph : public ExtendableSymGraph
    628628    {
Note: See TracChangeset for help on using the changeset viewer.