equal
deleted
inserted
replaced
236 /// This structure can be used to establish another graph over a node set |
236 /// This structure can be used to establish another graph over a node set |
237 /// of an existing one. The node iterator will go through the nodes of the |
237 /// of an existing one. The node iterator will go through the nodes of the |
238 /// original graph. |
238 /// original graph. |
239 /// |
239 /// |
240 /// \param _Graph The type of the graph which shares its node set with |
240 /// \param _Graph The type of the graph which shares its node set with |
241 /// this class. Its interface must conform to the \ref concept::StaticGraph |
241 /// this class. Its interface must conform to the \ref concept::Graph |
242 /// "StaticGraph" concept. |
242 /// "Graph" concept. |
243 /// |
243 /// |
244 /// In the edge extension and removing it conforms to the |
244 /// In the edge extension and removing it conforms to the |
245 /// \ref concept::ErasableGraph "ErasableGraph" concept. |
245 /// \ref concept::Graph "Graph" concept. |
246 template <typename _Graph> |
246 template <typename _Graph> |
247 class ListEdgeSet : public EdgeSetExtender<ListEdgeSetBase<_Graph> > { |
247 class ListEdgeSet : public EdgeSetExtender<ListEdgeSetBase<_Graph> > { |
248 |
248 |
249 public: |
249 public: |
250 |
250 |
328 /// This structure can be used to establish another graph over a node set |
328 /// This structure can be used to establish another graph over a node set |
329 /// of an existing one. The node iterator will go through the nodes of the |
329 /// of an existing one. The node iterator will go through the nodes of the |
330 /// original graph. |
330 /// original graph. |
331 /// |
331 /// |
332 /// \param _Graph The type of the graph which shares its node set with |
332 /// \param _Graph The type of the graph which shares its node set with |
333 /// this class. Its interface must conform to the \ref concept::StaticGraph |
333 /// this class. Its interface must conform to the \ref concept::Graph |
334 /// "StaticGraph" concept. |
334 /// "Graph" concept. |
335 /// |
335 /// |
336 /// In the edge extension and removing it conforms to the |
336 /// In the edge extension and removing it conforms to the |
337 /// \ref concept::ErasableUGraph "ErasableUGraph" concept. |
337 /// \ref concept::UGraph "UGraph" concept. |
338 template <typename _Graph> |
338 template <typename _Graph> |
339 class ListUEdgeSet |
339 class ListUEdgeSet |
340 : public UEdgeSetExtender<UndirGraphExtender<ListEdgeSetBase<_Graph> > > { |
340 : public UEdgeSetExtender<UndirGraphExtender<ListEdgeSetBase<_Graph> > > { |
341 |
341 |
342 public: |
342 public: |
565 /// This structure can be used to establish another graph over a node set |
565 /// This structure can be used to establish another graph over a node set |
566 /// of an existing one. The node iterator will go through the nodes of the |
566 /// of an existing one. The node iterator will go through the nodes of the |
567 /// original graph. |
567 /// original graph. |
568 /// |
568 /// |
569 /// \param _Graph The type of the graph which shares its node set with |
569 /// \param _Graph The type of the graph which shares its node set with |
570 /// this class. Its interface must conform to the \ref concept::StaticGraph |
570 /// this class. Its interface must conform to the \ref concept::Graph |
571 /// "StaticGraph" concept. |
571 /// "Graph" concept. |
572 /// |
572 /// |
573 /// In the edge extension and removing it conforms to the |
573 /// In the edge extension and removing it conforms to the |
574 /// \ref concept::ExtendableGraph "ExtendableGraph" concept. |
574 /// \ref concept::Graph "Graph" concept. |
575 template <typename _Graph> |
575 template <typename _Graph> |
576 class SmartEdgeSet : public EdgeSetExtender<SmartEdgeSetBase<_Graph> > { |
576 class SmartEdgeSet : public EdgeSetExtender<SmartEdgeSetBase<_Graph> > { |
577 |
577 |
578 public: |
578 public: |
579 |
579 |
660 /// This structure can be used to establish another graph over a node set |
660 /// This structure can be used to establish another graph over a node set |
661 /// of an existing one. The node iterator will go through the nodes of the |
661 /// of an existing one. The node iterator will go through the nodes of the |
662 /// original graph. |
662 /// original graph. |
663 /// |
663 /// |
664 /// \param _Graph The type of the graph which shares its node set with |
664 /// \param _Graph The type of the graph which shares its node set with |
665 /// this class. Its interface must conform to the \ref concept::StaticGraph |
665 /// this class. Its interface must conform to the \ref concept::Graph |
666 /// "StaticGraph" concept. |
666 /// "Graph" concept. |
667 /// |
667 /// |
668 /// In the edge extension and removing it conforms to the |
668 /// In the edge extension and removing it conforms to the |
669 /// \ref concept::ExtendableUGraph "ExtendableUGraph" concept. |
669 /// \ref concept::UGraph "UGraph" concept. |
670 template <typename _Graph> |
670 template <typename _Graph> |
671 class SmartUEdgeSet |
671 class SmartUEdgeSet |
672 : public UEdgeSetExtender<UndirGraphExtender<SmartEdgeSetBase<_Graph> > > { |
672 : public UEdgeSetExtender<UndirGraphExtender<SmartEdgeSetBase<_Graph> > > { |
673 |
673 |
674 public: |
674 public: |