equal
deleted
inserted
replaced
316 |
316 |
317 ///A list graph class. |
317 ///A list graph class. |
318 |
318 |
319 ///This is a simple and fast graph implementation. |
319 ///This is a simple and fast graph implementation. |
320 /// |
320 /// |
321 ///It conforms to the \ref concept::Graph "Graph concept" and it |
321 ///It conforms to the \ref concepts::Graph "Graph concept" and it |
322 ///also provides several additional useful extra functionalities. |
322 ///also provides several additional useful extra functionalities. |
323 ///The most of the member functions and nested classes are |
323 ///The most of the member functions and nested classes are |
324 ///documented only in the concept class. |
324 ///documented only in the concept class. |
325 /// |
325 /// |
326 ///An important extra feature of this graph implementation is that |
326 ///An important extra feature of this graph implementation is that |
327 ///its maps are real \ref concept::ReferenceMap "reference map"s. |
327 ///its maps are real \ref concepts::ReferenceMap "reference map"s. |
328 /// |
328 /// |
329 ///\sa concept::Graph. |
329 ///\sa concepts::Graph. |
330 |
330 |
331 class ListGraph : public ExtendedListGraphBase { |
331 class ListGraph : public ExtendedListGraphBase { |
332 private: |
332 private: |
333 ///ListGraph is \e not copy constructible. Use GraphCopy() instead. |
333 ///ListGraph is \e not copy constructible. Use GraphCopy() instead. |
334 |
334 |
746 ///An undirected list graph class. |
746 ///An undirected list graph class. |
747 |
747 |
748 ///This is a simple and fast undirected graph implementation. |
748 ///This is a simple and fast undirected graph implementation. |
749 /// |
749 /// |
750 ///An important extra feature of this graph implementation is that |
750 ///An important extra feature of this graph implementation is that |
751 ///its maps are real \ref concept::ReferenceMap "reference map"s. |
751 ///its maps are real \ref concepts::ReferenceMap "reference map"s. |
752 /// |
752 /// |
753 ///It conforms to the |
753 ///It conforms to the |
754 ///\ref concept::UGraph "UGraph concept". |
754 ///\ref concepts::UGraph "UGraph concept". |
755 /// |
755 /// |
756 ///\sa concept::UGraph. |
756 ///\sa concepts::UGraph. |
757 /// |
757 /// |
758 class ListUGraph : public ExtendedListUGraphBase { |
758 class ListUGraph : public ExtendedListUGraphBase { |
759 private: |
759 private: |
760 ///ListUGraph is \e not copy constructible. Use UGraphCopy() instead. |
760 ///ListUGraph is \e not copy constructible. Use UGraphCopy() instead. |
761 |
761 |
1495 /// \ingroup graphs |
1495 /// \ingroup graphs |
1496 /// |
1496 /// |
1497 /// \brief A smart bipartite undirected graph class. |
1497 /// \brief A smart bipartite undirected graph class. |
1498 /// |
1498 /// |
1499 /// This is a bipartite undirected graph implementation. |
1499 /// This is a bipartite undirected graph implementation. |
1500 /// It is conforms to the \ref concept::BpUGraph "BpUGraph concept". |
1500 /// It is conforms to the \ref concepts::BpUGraph "BpUGraph concept". |
1501 /// |
1501 /// |
1502 ///An important extra feature of this graph implementation is that |
1502 ///An important extra feature of this graph implementation is that |
1503 ///its maps are real \ref concept::ReferenceMap "reference map"s. |
1503 ///its maps are real \ref concepts::ReferenceMap "reference map"s. |
1504 /// |
1504 /// |
1505 /// \sa concept::BpUGraph. |
1505 /// \sa concepts::BpUGraph. |
1506 /// |
1506 /// |
1507 class ListBpUGraph : public ExtendedListBpUGraphBase { |
1507 class ListBpUGraph : public ExtendedListBpUGraphBase { |
1508 /// \brief ListBpUGraph is \e not copy constructible. |
1508 /// \brief ListBpUGraph is \e not copy constructible. |
1509 /// |
1509 /// |
1510 ///ListBpUGraph is \e not copy constructible. |
1510 ///ListBpUGraph is \e not copy constructible. |