equal
deleted
inserted
replaced
192 ///This is a simple and fast graph implementation. |
192 ///This is a simple and fast graph implementation. |
193 ///It is also quite memory efficient, but at the price |
193 ///It is also quite memory efficient, but at the price |
194 ///that <b> it does support only limited (only stack-like) |
194 ///that <b> it does support only limited (only stack-like) |
195 ///node and edge deletions</b>. |
195 ///node and edge deletions</b>. |
196 ///It conforms to |
196 ///It conforms to |
197 ///the \ref concept::Graph "Graph concept". |
197 ///the \ref concept::Graph "Graph concept" with an |
|
198 ///important extra feature that |
|
199 ///its maps are real \ref concept::ReferenceMap "reference map"s. |
|
200 /// |
198 ///\sa concept::Graph. |
201 ///\sa concept::Graph. |
199 /// |
202 /// |
200 ///\author Alpar Juttner |
203 ///\author Alpar Juttner |
201 class SmartGraph : public ExtendedSmartGraphBase { |
204 class SmartGraph : public ExtendedSmartGraphBase { |
202 public: |
205 public: |
376 /// It is also quite memory efficient, but at the price |
379 /// It is also quite memory efficient, but at the price |
377 /// that <b> it does support only limited (only stack-like) |
380 /// that <b> it does support only limited (only stack-like) |
378 /// node and edge deletions</b>. |
381 /// node and edge deletions</b>. |
379 /// Except from this it conforms to |
382 /// Except from this it conforms to |
380 /// the \ref concept::UGraph "UGraph concept". |
383 /// the \ref concept::UGraph "UGraph concept". |
|
384 /// |
|
385 ///It also has an |
|
386 ///important extra feature that |
|
387 ///its maps are real \ref concept::ReferenceMap "reference map"s. |
|
388 /// |
381 /// \sa concept::UGraph. |
389 /// \sa concept::UGraph. |
382 /// |
390 /// |
383 /// \todo Snapshot hasn't been implemented yet. |
391 /// \todo Snapshot hasn't been implemented yet. |
384 /// |
392 /// |
385 class SmartUGraph : public ExtendedSmartUGraphBase { |
393 class SmartUGraph : public ExtendedSmartUGraphBase { |
753 /// This is a simple and fast bipartite undirected graph implementation. |
761 /// This is a simple and fast bipartite undirected graph implementation. |
754 /// It is also quite memory efficient, but at the price |
762 /// It is also quite memory efficient, but at the price |
755 /// that <b> it does not support node and edge deletions</b>. |
763 /// that <b> it does not support node and edge deletions</b>. |
756 /// Except from this it conforms to |
764 /// Except from this it conforms to |
757 /// the \ref concept::BpUGraph "BpUGraph concept". |
765 /// the \ref concept::BpUGraph "BpUGraph concept". |
|
766 /// |
|
767 ///It also has an |
|
768 ///important extra feature that |
|
769 ///its maps are real \ref concept::ReferenceMap "reference map"s. |
|
770 /// |
758 /// \sa concept::BpUGraph. |
771 /// \sa concept::BpUGraph. |
759 /// |
772 /// |
760 class SmartBpUGraph : public ExtendedSmartBpUGraphBase { |
773 class SmartBpUGraph : public ExtendedSmartBpUGraphBase { |
761 private: |
774 private: |
762 |
775 |