1.1 --- a/lemon/concept/graph.h Tue Jul 11 15:50:19 2006 +0000
1.2 +++ b/lemon/concept/graph.h Tue Jul 11 16:09:49 2006 +0000
1.3 @@ -53,14 +53,11 @@
1.4 /// Defalult constructor.
1.5 ///
1.6 Graph() { }
1.7 + /// Class for identifying a node of the graph
1.8
1.9 - /// The base type of node iterators,
1.10 - /// or in other words, the trivial node iterator.
1.11 -
1.12 - /// This is the base type of each node iterator,
1.13 - /// thus each kind of node iterator converts to this.
1.14 - /// More precisely each kind of node iterator should be inherited
1.15 - /// from the trivial node iterator.
1.16 + /// This class identifies a node of the graph. It also serves
1.17 + /// as a base class of the node iterators,
1.18 + /// thus they will convert to this type.
1.19 class Node {
1.20 public:
1.21 /// Default constructor
1.22 @@ -149,10 +146,11 @@
1.23 };
1.24
1.25
1.26 - /// The base type of the edge iterators.
1.27 + /// Class for identifying an edge of the graph
1.28
1.29 - /// The base type of the edge iterators.
1.30 - ///
1.31 + /// This class identifies an edge of the graph. It also serves
1.32 + /// as a base class of the edge iterators,
1.33 + /// thus they will convert to this type.
1.34 class Edge {
1.35 public:
1.36 /// Default constructor
1.37 @@ -384,8 +382,6 @@
1.38 ///
1.39 /// ReadWrite map of the nodes to type \c T.
1.40 /// \sa Reference
1.41 - /// \warning Making maps that can handle bool type (NodeMap<bool>)
1.42 - /// needs some extra attention!
1.43 template<class T>
1.44 class NodeMap : public ReadWriteMap< Node, T > {
1.45 public:
1.46 @@ -409,8 +405,6 @@
1.47 ///
1.48 /// Reference map of the edges to type \c T.
1.49 /// \sa Reference
1.50 - /// \warning Making maps that can handle bool type (EdgeMap<bool>)
1.51 - /// needs some extra attention!
1.52 template<class T>
1.53 class EdgeMap : public ReadWriteMap<Edge,T> {
1.54 public: