lemon/smart_graph.h
changeset 2126 2c8adbee9fa6
parent 2116 b6a68c15a6a3
child 2128 509846825ddf
equal deleted inserted replaced
25:fe8aaba716cc 26:996dd281fd82
   237   ///This is a simple and fast graph implementation.
   237   ///This is a simple and fast graph implementation.
   238   ///It is also quite memory efficient, but at the price
   238   ///It is also quite memory efficient, but at the price
   239   ///that <b> it does support only limited (only stack-like)
   239   ///that <b> it does support only limited (only stack-like)
   240   ///node and edge deletions</b>.
   240   ///node and edge deletions</b>.
   241   ///It conforms to 
   241   ///It conforms to 
   242   ///the \ref concept::Graph "Graph" concept.
   242   ///the \ref concept::Graph "Graph concept".
   243   ///\sa concept::Graph.
   243   ///\sa concept::Graph.
   244   ///
   244   ///
   245   ///\author Alpar Juttner
   245   ///\author Alpar Juttner
   246   class SmartGraph : public ExtendedSmartGraphBase {
   246   class SmartGraph : public ExtendedSmartGraphBase {
   247   public:
   247   public:
   368   /// This is a simple and fast undirected graph implementation.
   368   /// This is a simple and fast undirected graph implementation.
   369   /// It is also quite memory efficient, but at the price
   369   /// It is also quite memory efficient, but at the price
   370   /// that <b> it does support only limited (only stack-like)
   370   /// that <b> it does support only limited (only stack-like)
   371   /// node and edge deletions</b>.
   371   /// node and edge deletions</b>.
   372   /// Except from this it conforms to 
   372   /// Except from this it conforms to 
   373   /// the \ref concept::UGraph "UGraph" concept.
   373   /// the \ref concept::UGraph "UGraph concept".
   374   /// \sa concept::UGraph.
   374   /// \sa concept::UGraph.
   375   ///
   375   ///
   376   /// \todo Snapshot hasn't been implemented yet.
   376   /// \todo Snapshot hasn't been implemented yet.
   377   ///
   377   ///
   378   class SmartUGraph : public ExtendedSmartUGraphBase {
   378   class SmartUGraph : public ExtendedSmartUGraphBase {
   602   ///
   602   ///
   603   /// This is a simple and fast bipartite undirected graph implementation.
   603   /// This is a simple and fast bipartite undirected graph implementation.
   604   /// It is also quite memory efficient, but at the price
   604   /// It is also quite memory efficient, but at the price
   605   /// that <b> it does not support node and edge deletions</b>.
   605   /// that <b> it does not support node and edge deletions</b>.
   606   /// Except from this it conforms to 
   606   /// Except from this it conforms to 
   607   /// the \ref concept::BpUGraph "BpUGraph" concept.
   607   /// the \ref concept::BpUGraph "BpUGraph concept".
   608   /// \sa concept::BpUGraph.
   608   /// \sa concept::BpUGraph.
   609   ///
   609   ///
   610   class SmartBpUGraph : public ExtendedSmartBpUGraphBase {};
   610   class SmartBpUGraph : public ExtendedSmartBpUGraphBase {};
   611 
   611 
   612   
   612