equal
deleted
inserted
replaced
44 |
44 |
45 /// \e |
45 /// \e |
46 UndirGraphEdge() {} |
46 UndirGraphEdge() {} |
47 |
47 |
48 /// \e |
48 /// \e |
49 UndirGraphEdge(const UndirGraphEdge&) {} |
49 UndirGraphEdge(const UndirGraphEdge& e) : UndirGraph::UndirEdge(e) {} |
50 |
50 |
51 /// \e |
51 /// \e |
52 UndirGraphEdge(Invalid) {} |
52 UndirGraphEdge(Invalid) {} |
53 |
53 |
54 /// \brief Directed edge from undirected edge and a source node. |
54 /// \brief Directed edge from undirected edge and a source node. |
467 } |
467 } |
468 |
468 |
469 /// Base node of the iterator |
469 /// Base node of the iterator |
470 /// |
470 /// |
471 /// Returns the base node of the iterator |
471 /// Returns the base node of the iterator |
472 Node baseNode(IncEdgeIt e) const { |
472 Node baseNode(IncEdgeIt) const { |
473 return INVALID; |
473 return INVALID; |
474 } |
474 } |
475 /// Running node of the iterator |
475 /// Running node of the iterator |
476 /// |
476 /// |
477 /// Returns the running node of the iterator |
477 /// Returns the running node of the iterator |
478 Node runningNode(IncEdgeIt e) const { |
478 Node runningNode(IncEdgeIt) const { |
479 return INVALID; |
479 return INVALID; |
480 } |
480 } |
481 |
481 |
482 |
482 |
483 template <typename Graph> |
483 template <typename Graph> |