src/work/peter/hierarchygraph.h
changeset 913 f2acaefc721c
parent 826 056fbb112b30
child 921 818510fa3d99
equal deleted inserted replaced
3:74763cadb253 4:f75ac668594a
   421     }
   421     }
   422 
   422 
   423     ///Read/write/reference map of the nodes to type \c T.
   423     ///Read/write/reference map of the nodes to type \c T.
   424 
   424 
   425     ///Read/write/reference map of the nodes to type \c T.
   425     ///Read/write/reference map of the nodes to type \c T.
   426     /// \sa MemoryMapSkeleton
   426     /// \sa MemoryMap
   427     /// \todo We may need copy constructor
   427     /// \todo We may need copy constructor
   428     /// \todo We may need conversion from other nodetype
   428     /// \todo We may need conversion from other nodetype
   429     /// \todo We may need operator=
   429     /// \todo We may need operator=
   430     /// \warning Making maps that can handle bool type (NodeMap<bool>)
   430     /// \warning Making maps that can handle bool type (NodeMap<bool>)
   431     /// needs extra attention!
   431     /// needs extra attention!
   480     ///Read/write/reference map of the edges to type \c T.
   480     ///Read/write/reference map of the edges to type \c T.
   481 
   481 
   482     ///Read/write/reference map of the edges to type \c T.
   482     ///Read/write/reference map of the edges to type \c T.
   483     ///It behaves exactly in the same way as \ref NodeMap.
   483     ///It behaves exactly in the same way as \ref NodeMap.
   484     /// \sa NodeMap
   484     /// \sa NodeMap
   485     /// \sa MemoryMapSkeleton
   485     /// \sa MemoryMap
   486     /// \todo We may need copy constructor
   486     /// \todo We may need copy constructor
   487     /// \todo We may need conversion from other edgetype
   487     /// \todo We may need conversion from other edgetype
   488     /// \todo We may need operator=
   488     /// \todo We may need operator=
   489     template < class T > class EdgeMap
   489     template < class T > class EdgeMap
   490     {
   490     {
   535   /// behind the interface.
   535   /// behind the interface.
   536   /// All graph algorithms should compile with this class, but it will not
   536   /// All graph algorithms should compile with this class, but it will not
   537   /// run properly, of course.
   537   /// run properly, of course.
   538   ///
   538   ///
   539   /// \todo This blabla could be replaced by a sepatate description about
   539   /// \todo This blabla could be replaced by a sepatate description about
   540   /// Skeletons.
   540   /// s.
   541   ///
   541   ///
   542   /// It can be used for checking the interface compatibility,
   542   /// It can be used for checking the interface compatibility,
   543   /// or it can serve as a skeleton of a new graph structure.
   543   /// or it can serve as a skeleton of a new graph structure.
   544   ///
   544   ///
   545   /// Also, you will find here the full documentation of a certain graph
   545   /// Also, you will find here the full documentation of a certain graph