equal
deleted
inserted
replaced
215 |
215 |
216 /// \brief Iterator for iterating on edges connected the same nodes. |
216 /// \brief Iterator for iterating on edges connected the same nodes. |
217 /// |
217 /// |
218 /// Iterator for iterating on edges connected the same nodes. It is |
218 /// Iterator for iterating on edges connected the same nodes. It is |
219 /// higher level interface for the findEdge() function. You can |
219 /// higher level interface for the findEdge() function. You can |
220 /// use it the following was: |
220 /// use it the following way: |
221 /// \code |
221 /// \code |
222 /// for (ConEdgeIt<Graph> it(g, src, trg); it != INVALID; ++it) { |
222 /// for (ConEdgeIt<Graph> it(g, src, trg); it != INVALID; ++it) { |
223 /// ... |
223 /// ... |
224 /// } |
224 /// } |
225 /// \endcode |
225 /// \endcode |