lemon/concepts/graph.h
branch1.1
changeset 671 73ee142260f2
parent 572 2313edd0db0b
child 807 3e711ee55d31
equal deleted inserted replaced
11:06cdc101bc32 12:698b036acaf4
   308 
   308 
   309       /// The directed arc type.
   309       /// The directed arc type.
   310 
   310 
   311       /// The directed arc type. It can be converted to the
   311       /// The directed arc type. It can be converted to the
   312       /// edge or it should be inherited from the undirected
   312       /// edge or it should be inherited from the undirected
   313       /// arc.
   313       /// edge.
   314       class Arc : public Edge {
   314       class Arc {
   315       public:
   315       public:
   316         /// Default constructor
   316         /// Default constructor
   317 
   317 
   318         /// @warning The default constructor sets the iterator
   318         /// @warning The default constructor sets the iterator
   319         /// to an undefined value.
   319         /// to an undefined value.
   320         Arc() { }
   320         Arc() { }
   321         /// Copy constructor.
   321         /// Copy constructor.
   322 
   322 
   323         /// Copy constructor.
   323         /// Copy constructor.
   324         ///
   324         ///
   325         Arc(const Arc& e) : Edge(e) { }
   325         Arc(const Arc&) { }
   326         /// Initialize the iterator to be invalid.
   326         /// Initialize the iterator to be invalid.
   327 
   327 
   328         /// Initialize the iterator to be invalid.
   328         /// Initialize the iterator to be invalid.
   329         ///
   329         ///
   330         Arc(Invalid) { }
   330         Arc(Invalid) { }
   347         /// \note This operator only have to define some strict ordering of
   347         /// \note This operator only have to define some strict ordering of
   348         /// the items; this order has nothing to do with the iteration
   348         /// the items; this order has nothing to do with the iteration
   349         /// ordering of the items.
   349         /// ordering of the items.
   350         bool operator<(Arc) const { return false; }
   350         bool operator<(Arc) const { return false; }
   351 
   351 
       
   352         /// Converison to Edge
       
   353         operator Edge() const { return Edge(); }
   352       };
   354       };
   353       /// This iterator goes through each directed arc.
   355       /// This iterator goes through each directed arc.
   354 
   356 
   355       /// This iterator goes through each arc of a graph.
   357       /// This iterator goes through each arc of a graph.
   356       /// Its usage is quite simple, for example you can count the number
   358       /// Its usage is quite simple, for example you can count the number