lemon/path.h
changeset 1769 a67ec111236c
parent 1435 8e85e6bbefdf
child 1875 98698b69a902
equal deleted inserted replaced
0:72ba87ec9f99 1:658cc05e5eb7
   381   //! In a sense, the path can be treated as a graph, for is has \c NodeIt
   381   //! In a sense, the path can be treated as a graph, for is has \c NodeIt
   382   //! and \c EdgeIt with the same usage. These types converts to the \c Node
   382   //! and \c EdgeIt with the same usage. These types converts to the \c Node
   383   //! and \c Edge of the original graph.
   383   //! and \c Edge of the original graph.
   384   //!
   384   //!
   385   //! \todo Thoroughfully check all the range and consistency tests.
   385   //! \todo Thoroughfully check all the range and consistency tests.
       
   386   /// \todo May we need just path for undirected graph instead of this.
   386   template<typename Graph>
   387   template<typename Graph>
   387   class UndirPath {
   388   class UndirPath {
   388   public:
   389   public:
   389     /// Edge type of the underlying graph.
   390     /// Edge type of the underlying graph.
   390     typedef typename Graph::Edge GraphEdge;
   391     typedef typename Graph::Edge GraphEdge;