equal
deleted
inserted
replaced
223 /// |
223 /// |
224 SmartDigraph() {}; |
224 SmartDigraph() {}; |
225 |
225 |
226 ///Add a new node to the digraph. |
226 ///Add a new node to the digraph. |
227 |
227 |
228 /// \return the new node. |
228 /// Add a new node to the digraph. |
229 /// |
229 /// \return The new node. |
230 Node addNode() { return Parent::addNode(); } |
230 Node addNode() { return Parent::addNode(); } |
231 |
231 |
232 ///Add a new arc to the digraph. |
232 ///Add a new arc to the digraph. |
233 |
233 |
234 ///Add a new arc to the digraph with source node \c s |
234 ///Add a new arc to the digraph with source node \c s |
235 ///and target node \c t. |
235 ///and target node \c t. |
236 ///\return the new arc. |
236 ///\return The new arc. |
237 Arc addArc(const Node& s, const Node& t) { |
237 Arc addArc(const Node& s, const Node& t) { |
238 return Parent::addArc(s, t); |
238 return Parent::addArc(s, t); |
239 } |
239 } |
240 |
240 |
241 /// \brief Using this it is possible to avoid the superfluous memory |
241 /// \brief Using this it is possible to avoid the superfluous memory |
664 /// |
664 /// |
665 SmartGraph() {} |
665 SmartGraph() {} |
666 |
666 |
667 ///Add a new node to the graph. |
667 ///Add a new node to the graph. |
668 |
668 |
669 /// \return the new node. |
669 /// Add a new node to the graph. |
670 /// |
670 /// \return The new node. |
671 Node addNode() { return Parent::addNode(); } |
671 Node addNode() { return Parent::addNode(); } |
672 |
672 |
673 ///Add a new edge to the graph. |
673 ///Add a new edge to the graph. |
674 |
674 |
675 ///Add a new edge to the graph with node \c s |
675 ///Add a new edge to the graph with node \c s |
676 ///and \c t. |
676 ///and \c t. |
677 ///\return the new edge. |
677 ///\return The new edge. |
678 Edge addEdge(const Node& s, const Node& t) { |
678 Edge addEdge(const Node& s, const Node& t) { |
679 return Parent::addEdge(s, t); |
679 return Parent::addEdge(s, t); |
680 } |
680 } |
681 |
681 |
682 /// \brief Node validity check |
682 /// \brief Node validity check |