lemon/list_graph.h
changeset 2257 0a9393adc747
parent 2231 06faf3f06d67
child 2260 4274224f8a7d
equal deleted inserted replaced
39:4395b7935411 40:2c2dd373b47b
   320   ///
   320   ///
   321   ///It conforms to the \ref concept::Graph "Graph concept" and it
   321   ///It conforms to the \ref concept::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   ///
       
   326   ///An important extra feature of this graph implementation is that
       
   327   ///its maps are real \ref concept::ReferenceMap "reference map"s.
       
   328   ///
   325   ///\sa concept::Graph.
   329   ///\sa concept::Graph.
   326 
   330 
   327   class ListGraph : public ExtendedListGraphBase {
   331   class ListGraph : public ExtendedListGraphBase {
   328   private:
   332   private:
   329     ///ListGraph is \e not copy constructible. Use GraphCopy() instead.
   333     ///ListGraph is \e not copy constructible. Use GraphCopy() instead.
   741 
   745 
   742   ///An undirected list graph class.
   746   ///An undirected list graph class.
   743 
   747 
   744   ///This is a simple and fast undirected graph implementation.
   748   ///This is a simple and fast undirected graph implementation.
   745   ///
   749   ///
       
   750   ///An important extra feature of this graph implementation is that
       
   751   ///its maps are real \ref concept::ReferenceMap "reference map"s.
       
   752   ///
   746   ///It conforms to the
   753   ///It conforms to the
   747   ///\ref concept::UGraph "UGraph concept".
   754   ///\ref concept::UGraph "UGraph concept".
   748   ///
   755   ///
   749   ///\sa concept::UGraph.
   756   ///\sa concept::UGraph.
   750   ///
   757   ///
  1489   ///
  1496   ///
  1490   /// \brief A smart bipartite undirected graph class.
  1497   /// \brief A smart bipartite undirected graph class.
  1491   ///
  1498   ///
  1492   /// This is a bipartite undirected graph implementation.
  1499   /// This is a bipartite undirected graph implementation.
  1493   /// It is conforms to the \ref concept::BpUGraph "BpUGraph concept".
  1500   /// It is conforms to the \ref concept::BpUGraph "BpUGraph concept".
       
  1501   ///
       
  1502   ///An important extra feature of this graph implementation is that
       
  1503   ///its maps are real \ref concept::ReferenceMap "reference map"s.
       
  1504   ///
  1494   /// \sa concept::BpUGraph.
  1505   /// \sa concept::BpUGraph.
  1495   ///
  1506   ///
  1496   class ListBpUGraph : public ExtendedListBpUGraphBase {
  1507   class ListBpUGraph : public ExtendedListBpUGraphBase {
  1497     /// \brief ListBpUGraph is \e not copy constructible.
  1508     /// \brief ListBpUGraph is \e not copy constructible.
  1498     ///
  1509     ///