lemon/concept/graph.h
changeset 1630 f67737f5727a
parent 1627 3fd1ba6e9872
child 1631 e15162d8eca1
equal deleted inserted replaced
7:deb4f565c4c0 8:b3c3a34a5095
   425 
   425 
   426       ///Gives back the source node of an edge.
   426       ///Gives back the source node of an edge.
   427       ///
   427       ///
   428       Node source(Edge) const { return INVALID; }
   428       Node source(Edge) const { return INVALID; }
   429 
   429 
   430       /// Gives back the first Node in the iterating order.
   430 //       /// Gives back the first Node in the iterating order.
   431       
   431       
   432       /// Gives back the first Node in the iterating order.
   432 //       /// Gives back the first Node in the iterating order.
   433       ///     
   433 //       ///     
   434       void first(Node&) const {}
   434       void first(Node&) const {}
   435 
   435 
   436       /// Gives back the next Node in the iterating order.
   436 //       /// Gives back the next Node in the iterating order.
   437       
   437       
   438       /// Gives back the next Node in the iterating order.
   438 //       /// Gives back the next Node in the iterating order.
   439       ///     
   439 //       ///     
   440       void next(Node&) const {}
   440       void next(Node&) const {}
   441 
   441 
   442       /// Gives back the first Edge in the iterating order.
   442 //       /// Gives back the first Edge in the iterating order.
   443       
   443       
   444       /// Gives back the first Edge in the iterating order.
   444 //       /// Gives back the first Edge in the iterating order.
   445       ///     
   445 //       ///     
   446       void first(Edge&) const {}
   446       void first(Edge&) const {}
   447       /// Gives back the next Edge in the iterating order.
   447 //       /// Gives back the next Edge in the iterating order.
   448       
   448       
   449       /// Gives back the next Edge in the iterating order.
   449 //       /// Gives back the next Edge in the iterating order.
   450       ///     
   450 //       ///     
   451       void next(Edge&) const {}
   451       void next(Edge&) const {}
   452 
   452 
   453 
   453 
   454       /// Gives back the first of the Edges point to the given Node.
   454 //       /// Gives back the first of the Edges point to the given Node.
   455       
   455       
   456       /// Gives back the first of the Edges point to the given Node.
   456 //       /// Gives back the first of the Edges point to the given Node.
   457       ///     
   457 //       ///     
   458       void firstIn(Edge&, const Node&) const {}
   458       void firstIn(Edge&, const Node&) const {}
   459 
   459 
   460       /// Gives back the next of the Edges points to the given Node.
   460 //       /// Gives back the next of the Edges points to the given Node.
   461 
   461 
   462 
   462 
   463       /// Gives back the next of the Edges points to the given Node.
   463 //       /// Gives back the next of the Edges points to the given Node.
   464       ///
   464 //       ///
   465       void nextIn(Edge&) const {}
   465       void nextIn(Edge&) const {}
   466 
   466 
   467       /// Gives back the first of the Edges start from the given Node.
   467 //       /// Gives back the first of the Edges start from the given Node.
   468       
   468       
   469       /// Gives back the first of the Edges start from the given Node.
   469 //       /// Gives back the first of the Edges start from the given Node.
   470       ///     
   470 //       ///     
   471       void firstOut(Edge&, const Node&) const {}
   471       void firstOut(Edge&, const Node&) const {}
   472 
   472 
   473       /// Gives back the next of the Edges start from the given Node.
   473 //       /// Gives back the next of the Edges start from the given Node.
   474       
   474       
   475       /// Gives back the next of the Edges start from the given Node.
   475 //       /// Gives back the next of the Edges start from the given Node.
   476       ///     
   476 //       ///     
   477       void nextOut(Edge&) const {}
   477       void nextOut(Edge&) const {}
   478 
   478 
   479       /// \brief The base node of the iterator.
   479       /// \brief The base node of the iterator.
   480       ///
   480       ///
   481       /// Gives back the base node of the iterator.
   481       /// Gives back the base node of the iterator.
   509       /// 
   509       /// 
   510       /// ReadWrite map of the nodes to type \c T.
   510       /// ReadWrite map of the nodes to type \c T.
   511       /// \sa Reference
   511       /// \sa Reference
   512       /// \warning Making maps that can handle bool type (NodeMap<bool>)
   512       /// \warning Making maps that can handle bool type (NodeMap<bool>)
   513       /// needs some extra attention!
   513       /// needs some extra attention!
       
   514       /// \todo Wrong documentation
   514       template<class T> 
   515       template<class T> 
   515       class NodeMap : public ReadWriteMap< Node, T >
   516       class NodeMap : public ReadWriteMap< Node, T >
   516       {
   517       {
   517       public:
   518       public:
   518 
   519 
   532       ///
   533       ///
   533       /// Reference map of the edges to type \c T.
   534       /// Reference map of the edges to type \c T.
   534       /// \sa Reference
   535       /// \sa Reference
   535       /// \warning Making maps that can handle bool type (EdgeMap<bool>)
   536       /// \warning Making maps that can handle bool type (EdgeMap<bool>)
   536       /// needs some extra attention!
   537       /// needs some extra attention!
       
   538       /// \todo Wrong documentation
   537       template<class T> 
   539       template<class T> 
   538       class EdgeMap : public ReadWriteMap<Edge,T>
   540       class EdgeMap : public ReadWriteMap<Edge,T>
   539       {
   541       {
   540       public:
   542       public:
   541 
   543