Changeset 2128:509846825ddf in lemon-0.x for lemon/concept/graph.h
- Timestamp:
- 07/11/06 18:09:49 (18 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2841
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/concept/graph.h
r2126 r2128 54 54 /// 55 55 Graph() { } 56 57 /// The base type of node iterators, 58 /// or in other words, the trivial node iterator. 59 60 /// This is the base type of each node iterator, 61 /// thus each kind of node iterator converts to this. 62 /// More precisely each kind of node iterator should be inherited 63 /// from the trivial node iterator. 56 /// Class for identifying a node of the graph 57 58 /// This class identifies a node of the graph. It also serves 59 /// as a base class of the node iterators, 60 /// thus they will convert to this type. 64 61 class Node { 65 62 public: … … 150 147 151 148 152 /// The base type of the edge iterators. 153 154 /// The base type of the edge iterators. 155 /// 149 /// Class for identifying an edge of the graph 150 151 /// This class identifies an edge of the graph. It also serves 152 /// as a base class of the edge iterators, 153 /// thus they will convert to this type. 156 154 class Edge { 157 155 public: … … 385 383 /// ReadWrite map of the nodes to type \c T. 386 384 /// \sa Reference 387 /// \warning Making maps that can handle bool type (NodeMap<bool>)388 /// needs some extra attention!389 385 template<class T> 390 386 class NodeMap : public ReadWriteMap< Node, T > { … … 410 406 /// Reference map of the edges to type \c T. 411 407 /// \sa Reference 412 /// \warning Making maps that can handle bool type (EdgeMap<bool>)413 /// needs some extra attention!414 408 template<class T> 415 409 class EdgeMap : public ReadWriteMap<Edge,T> {
Note: See TracChangeset
for help on using the changeset viewer.