src/work/peter/edgepathgraph.h
changeset 907 df8472ab5d4a
parent 826 056fbb112b30
child 921 818510fa3d99
equal deleted inserted replaced
1:84419a0af326 2:bb7a47c98020
   294     int edgeNum() const { return actuallayer.edgeNum();}
   294     int edgeNum() const { return actuallayer.edgeNum();}
   295 
   295 
   296     ///Read/write/reference map of the nodes to type \c T.
   296     ///Read/write/reference map of the nodes to type \c T.
   297 
   297 
   298     ///Read/write/reference map of the nodes to type \c T.
   298     ///Read/write/reference map of the nodes to type \c T.
   299     /// \sa MemoryMapSkeleton
   299     /// \sa MemoryMap
   300     /// \todo We may need copy constructor
   300     /// \todo We may need copy constructor
   301     /// \todo We may need conversion from other nodetype
   301     /// \todo We may need conversion from other nodetype
   302     /// \todo We may need operator=
   302     /// \todo We may need operator=
   303     /// \warning Making maps that can handle bool type (NodeMap<bool>)
   303     /// \warning Making maps that can handle bool type (NodeMap<bool>)
   304     /// needs extra attention!
   304     /// needs extra attention!
   335     ///Read/write/reference map of the edges to type \c T.
   335     ///Read/write/reference map of the edges to type \c T.
   336 
   336 
   337     ///Read/write/reference map of the edges to type \c T.
   337     ///Read/write/reference map of the edges to type \c T.
   338     ///It behaves exactly in the same way as \ref NodeMap.
   338     ///It behaves exactly in the same way as \ref NodeMap.
   339     /// \sa NodeMap
   339     /// \sa NodeMap
   340     /// \sa MemoryMapSkeleton
   340     /// \sa MemoryMap
   341     /// \todo We may need copy constructor
   341     /// \todo We may need copy constructor
   342     /// \todo We may need conversion from other edgetype
   342     /// \todo We may need conversion from other edgetype
   343     /// \todo We may need operator=
   343     /// \todo We may need operator=
   344     template<class T> class EdgeMap
   344     template<class T> class EdgeMap
   345     {
   345     {
   372   /// behind the interface.
   372   /// behind the interface.
   373   /// All graph algorithms should compile with this class, but it will not
   373   /// All graph algorithms should compile with this class, but it will not
   374   /// run properly, of course.
   374   /// run properly, of course.
   375   ///
   375   ///
   376   /// \todo This blabla could be replaced by a sepatate description about
   376   /// \todo This blabla could be replaced by a sepatate description about
   377   /// Skeletons.
   377   /// s.
   378   ///
   378   ///
   379   /// It can be used for checking the interface compatibility,
   379   /// It can be used for checking the interface compatibility,
   380   /// or it can serve as a skeleton of a new graph structure.
   380   /// or it can serve as a skeleton of a new graph structure.
   381   /// 
   381   /// 
   382   /// Also, you will find here the full documentation of a certain graph
   382   /// Also, you will find here the full documentation of a certain graph