equal
deleted
inserted
replaced
371 ///\code |
371 ///\code |
372 /// for(Edge e=findEdge(g,u,v);e!=INVALID;e=findEdge(g,u,v,e)) { |
372 /// for(Edge e=findEdge(g,u,v);e!=INVALID;e=findEdge(g,u,v,e)) { |
373 /// ... |
373 /// ... |
374 /// } |
374 /// } |
375 ///\endcode |
375 ///\endcode |
|
376 /// |
|
377 ///\sa ConEdgeIt |
376 template <typename Graph> |
378 template <typename Graph> |
377 inline typename Graph::Edge findEdge(const Graph &g, |
379 inline typename Graph::Edge findEdge(const Graph &g, |
378 typename Graph::Node u, |
380 typename Graph::Node u, |
379 typename Graph::Node v, |
381 typename Graph::Node v, |
380 typename Graph::Edge prev = INVALID) { |
382 typename Graph::Edge prev = INVALID) { |
389 ///\code |
391 ///\code |
390 /// for (ConEdgeIt<Graph> it(g, src, trg); it != INVALID; ++it) { |
392 /// for (ConEdgeIt<Graph> it(g, src, trg); it != INVALID; ++it) { |
391 /// ... |
393 /// ... |
392 /// } |
394 /// } |
393 ///\endcode |
395 ///\endcode |
|
396 /// |
|
397 ///\sa findEdge() |
394 /// |
398 /// |
395 /// \author Balazs Dezso |
399 /// \author Balazs Dezso |
396 template <typename _Graph> |
400 template <typename _Graph> |
397 class ConEdgeIt : public _Graph::Edge { |
401 class ConEdgeIt : public _Graph::Edge { |
398 public: |
402 public: |
491 /// for(UEdge e = findUEdge(g,u,v); e != INVALID; |
495 /// for(UEdge e = findUEdge(g,u,v); e != INVALID; |
492 /// e = findUEdge(g,u,v,e)) { |
496 /// e = findUEdge(g,u,v,e)) { |
493 /// ... |
497 /// ... |
494 /// } |
498 /// } |
495 ///\endcode |
499 ///\endcode |
|
500 /// |
|
501 ///\sa ConEdgeIt |
|
502 |
496 template <typename Graph> |
503 template <typename Graph> |
497 inline typename Graph::UEdge findUEdge(const Graph &g, |
504 inline typename Graph::UEdge findUEdge(const Graph &g, |
498 typename Graph::Node u, |
505 typename Graph::Node u, |
499 typename Graph::Node v, |
506 typename Graph::Node v, |
500 typename Graph::UEdge p = INVALID) { |
507 typename Graph::UEdge p = INVALID) { |
509 ///\code |
516 ///\code |
510 /// for (ConUEdgeIt<Graph> it(g, src, trg); it != INVALID; ++it) { |
517 /// for (ConUEdgeIt<Graph> it(g, src, trg); it != INVALID; ++it) { |
511 /// ... |
518 /// ... |
512 /// } |
519 /// } |
513 ///\endcode |
520 ///\endcode |
|
521 /// |
|
522 ///\sa findUEdge() |
514 /// |
523 /// |
515 /// \author Balazs Dezso |
524 /// \author Balazs Dezso |
516 template <typename _Graph> |
525 template <typename _Graph> |
517 class ConUEdgeIt : public _Graph::UEdge { |
526 class ConUEdgeIt : public _Graph::UEdge { |
518 public: |
527 public: |