404 ///Gives back the source node of an edge. |
404 ///Gives back the source node of an edge. |
405 |
405 |
406 ///Gives back the source node of an edge. |
406 ///Gives back the source node of an edge. |
407 /// |
407 /// |
408 Node source(Edge) const { return INVALID; } |
408 Node source(Edge) const { return INVALID; } |
|
409 |
|
410 /// Gives back the first Node in the iterating order. |
|
411 |
|
412 /// Gives back the first Node in the iterating order. |
|
413 /// |
|
414 void first(Node&) const {} |
|
415 |
|
416 /// Gives back the next Node in the iterating order. |
|
417 |
|
418 /// Gives back the next Node in the iterating order. |
|
419 /// |
|
420 void next(Node&) const {} |
|
421 |
|
422 /// Gives back the first Edge in the iterating order. |
|
423 |
|
424 /// Gives back the first Edge in the iterating order. |
|
425 /// |
|
426 void first(Edge&) const {} |
|
427 /// Gives back the next Edge in the iterating order. |
|
428 |
|
429 /// Gives back the next Edge in the iterating order. |
|
430 /// |
|
431 void next(Edge&) const {} |
|
432 |
|
433 |
|
434 /// Gives back the first of the Edges point to the given Node. |
|
435 |
|
436 /// Gives back the first of the Edges point to the given Node. |
|
437 /// |
|
438 void firstIn(Edge&, const Node&) const {} |
|
439 |
|
440 /// Gives back the next of the Edges points to the given Node. |
|
441 |
|
442 |
|
443 /// Gives back the next of the Edges points to the given Node. |
|
444 /// |
|
445 void nextIn(Edge&) const {} |
|
446 |
|
447 /// Gives back the first of the Edges start from the given Node. |
|
448 |
|
449 /// Gives back the first of the Edges start from the given Node. |
|
450 /// |
|
451 void firstOut(Edge&, const Node&) const {} |
|
452 |
|
453 /// Gives back the next of the Edges start from the given Node. |
|
454 |
|
455 /// Gives back the next of the Edges start from the given Node. |
|
456 /// |
|
457 void nextOut(Edge&) const {} |
|
458 |
|
459 /// \brief The base node of the iterator. |
|
460 /// |
|
461 /// Gives back the base node of the iterator. |
|
462 Node baseNode(const InEdgeIt&) const { return INVALID; } |
|
463 |
|
464 /// \brief The running node of the iterator. |
|
465 /// |
|
466 /// Gives back the running node of the iterator. |
|
467 Node runningNode(const InEdgeIt&) const { return INVALID; } |
|
468 |
|
469 /// \brief The base node of the iterator. |
|
470 /// |
|
471 /// Gives back the base node of the iterator. |
|
472 Node baseNode(const OutEdgeIt&) const { return INVALID; } |
|
473 |
|
474 /// \brief The running node of the iterator. |
|
475 /// |
|
476 /// Gives back the running node of the iterator. |
|
477 Node runningNode(const OutEdgeIt&) const { return INVALID; } |
409 /// Read write map of the nodes to type \c T. |
478 /// Read write map of the nodes to type \c T. |
410 |
479 |
411 /// \ingroup concept |
480 /// \ingroup concept |
412 /// ReadWrite map of the nodes to type \c T. |
481 /// ReadWrite map of the nodes to type \c T. |
413 /// \sa Reference |
482 /// \sa Reference |