*/

 */

 ///\ingroup paths

 ///\ingroup paths

 ///\file

 ///\file

 ///\brief Classes for representing paths in graphs.

 ///\brief Classes for representing paths in graphs.

 #ifndef LEMON_PATH_H

 #ifndef LEMON_PATH_H

 #define LEMON_PATH_H

 #define LEMON_PATH_H

 #include <deque>

 #include <deque>

     /* Iterator classes */

     /* Iterator classes */

     /**

     /**

      * \brief Iterator class to iterate on the edges of the paths

      * \brief Iterator class to iterate on the edges of the paths

      *

      *

      * This class is used to iterate on the edges of the paths

      * This class is used to iterate on the edges of the paths

      *

      *

      * Of course it converts to Graph::Edge

      * Of course it converts to Graph::Edge

      *

      *

      */

      */

     };

     };

     /**

     /**

      * \brief Iterator class to iterate on the nodes of the paths

      * \brief Iterator class to iterate on the nodes of the paths

      *

      *

      * This class is used to iterate on the nodes of the paths

      * This class is used to iterate on the nodes of the paths

      *

      *

      * Of course it converts to Graph::Node

      * Of course it converts to Graph::Node

      *

      *

      */

      */

     friend class Builder;

     friend class Builder;

     /**

     /**

      * \brief Class to build paths

      * \brief Class to build paths

      *

      *

      * This class is used to fill a path with edges.

      * This class is used to fill a path with edges.

      *

      *

      * You can push new edges to the front and to the back of the path in

      * You can push new edges to the front and to the back of the path in

      * arbitrary order then you should commit these changes to the graph.

      * arbitrary order then you should commit these changes to the graph.

      *

      *

     /**

     /**

      * \brief Iterator class to iterate on the edges of the paths

      * \brief Iterator class to iterate on the edges of the paths

      *

      *

      * This class is used to iterate on the edges of the paths

      * This class is used to iterate on the edges of the paths

      *

      *

      * Of course it converts to Graph::Edge

      * Of course it converts to Graph::Edge

      *

      *

      * \todo Its interface differs from the standard edge iterator.

      * \todo Its interface differs from the standard edge iterator.

     };

     };

     /**

     /**

      * \brief Iterator class to iterate on the nodes of the paths

      * \brief Iterator class to iterate on the nodes of the paths

      *

      *

      * This class is used to iterate on the nodes of the paths

      * This class is used to iterate on the nodes of the paths

      *

      *

      * Of course it converts to Graph::Node

      * Of course it converts to Graph::Node

      *

      *

      * \todo Its interface differs from the standard node iterator.

      * \todo Its interface differs from the standard node iterator.

     friend class Builder;

     friend class Builder;

     /**

     /**

      * \brief Class to build paths

      * \brief Class to build paths

      *

      *

      * This class is used to fill a path with edges.

      * This class is used to fill a path with edges.

      *

      *

      * You can push new edges to the front and to the back of the path in

      * You can push new edges to the front and to the back of the path in

      * arbitrary order then you should commit these changes to the graph.

      * arbitrary order then you should commit these changes to the graph.

      *

      *