Changeset 1527:7ceab500e1f6 in lemon-0.x for lemon/concept
- Timestamp:
- 07/01/05 12:33:27 (19 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2014
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/concept/sym_graph.h
r1526 r1527 43 43 /// or it can serve as a skeleton of a new symmetric graph structure. 44 44 /// 45 /// Also, you will find here the full documentation of a certaingraph46 /// feature , the documentation of a real symmetric graph imlementation45 /// Also, you will find here the full documentation of graph 46 /// features, the documentation of a real symmetric graph imlementation 47 47 /// like @ref SymListGraph or 48 48 /// @ref lemon::SymSmartGraph will just refer to this structure. … … 55 55 /// 56 56 StaticSymGraph() { } 57 // /Copy consructor.57 // ///Copy consructor. 58 58 59 59 // ///\todo It is not clear, what we expect from a copy constructor. … … 94 94 /// Inequality operator 95 95 96 /// \sa operator==(Node n)96 /// \sa operator==(Node) 97 97 /// 98 98 bool operator!=(Node) const { return true; } … … 142 142 143 143 /// Sets the iterator to the node of \c g pointed by the trivial 144 /// iterator n.144 /// iterator \c n. 145 145 /// 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. 147 147 NodeIt(const StaticSymGraph& g, const Node& n) { } 148 148 /// Next node. … … 268 268 /// This constructor sets the iterator to first outgoing edge. 269 269 270 /// This constructor set the iterator to the first outgoing edge of271 /// node270 /// This constructor sets the iterator to the first outgoing edge of 271 /// the node 272 272 ///@param n the node 273 273 ///@param g the graph … … 317 317 /// This constructor sets the iterator to first incoming edge. 318 318 319 /// This constructor set the iterator to the first incoming edge of320 /// node319 /// This constructor sets the iterator to the first incoming edge of 320 /// the node 321 321 ///@param n the node 322 322 ///@param g the graph … … 362 362 /// This constructor sets the iterator to first edge. 363 363 364 /// This constructor set the iterator to the first edge of365 /// node364 /// This constructor sets the iterator to the first edge of 365 /// the graph 366 366 ///@param g the graph 367 367 SymEdgeIt(const StaticSymGraph& g) { } … … 406 406 /// This constructor sets the iterator to first edge. 407 407 408 /// This constructor set the iterator to the first edge of409 /// node408 /// This constructor sets the iterator to the first edge of 409 /// the graph 410 410 ///@param g the graph 411 411 EdgeIt(const StaticSymGraph& g) { } … … 590 590 /// An empty non-static graph class. 591 591 592 /// This class provides everything that\ref StaticGraph593 /// with additional functionality which enablesto build a592 /// This class is an extension of \ref StaticGraph 593 /// with additional functionality that enables one to build a 594 594 /// graph from scratch. 595 class ExtendableSymGraph : public StaticSymGraph595 class ExtendableSymGraph : public StaticSymGraph 596 596 { 597 597 public: … … 623 623 /// An empty erasable graph class. 624 624 625 /// This class is an extension of \ref ExtendableGraph. It also makes it626 /// 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. 627 627 class ErasableSymGraph : public ExtendableSymGraph 628 628 {
Note: See TracChangeset
for help on using the changeset viewer.