equal
deleted
inserted
replaced
175 /// \code |
175 /// \code |
176 /// for(Edge e=findEdge(g,u,v);e!=INVALID;e=findEdge(g,u,v,e)) { |
176 /// for(Edge e=findEdge(g,u,v);e!=INVALID;e=findEdge(g,u,v,e)) { |
177 /// ... |
177 /// ... |
178 /// } |
178 /// } |
179 /// \endcode |
179 /// \endcode |
180 /// \todo We may want to use the \ref concept::GraphBase "GraphBase" |
180 /// \todo We may want to use the "GraphBase" |
181 /// interface here... |
181 /// interface here... |
182 /// \bug Untested ... |
182 /// \bug Untested ... |
183 template <typename Graph> |
183 template <typename Graph> |
184 typename Graph::Edge findEdge(const Graph &g, |
184 typename Graph::Edge findEdge(const Graph &g, |
185 typename Graph::Node u, typename Graph::Node v, |
185 typename Graph::Node u, typename Graph::Node v, |
857 TargetMap(const Graph& _graph) : graph(_graph) {} |
857 TargetMap(const Graph& _graph) : graph(_graph) {} |
858 |
858 |
859 /// \brief The subscript operator. |
859 /// \brief The subscript operator. |
860 /// |
860 /// |
861 /// The subscript operator. |
861 /// The subscript operator. |
862 /// \param edge The edge |
862 /// \param e The edge |
863 /// \return The target of the edge |
863 /// \return The target of the edge |
864 Value operator[](const Key& key) { |
864 Value operator[](const Key& e) { |
865 return graph.target(key); |
865 return graph.target(e); |
866 } |
866 } |
867 |
867 |
868 private: |
868 private: |
869 const Graph& graph; |
869 const Graph& graph; |
870 }; |
870 }; |