equal
deleted
inserted
replaced
234 ///node and edge deletions</b>. |
234 ///node and edge deletions</b>. |
235 ///It conforms to |
235 ///It conforms to |
236 ///the \ref concept::ExtendableGraph "ExtendableGraph" concept. |
236 ///the \ref concept::ExtendableGraph "ExtendableGraph" concept. |
237 ///\sa concept::ExtendableGraph. |
237 ///\sa concept::ExtendableGraph. |
238 /// |
238 /// |
239 ///\todo Some member functions could be \c static. |
|
240 /// |
|
241 ///\author Alpar Juttner |
239 ///\author Alpar Juttner |
242 class SmartGraph : public ClearableSmartGraphBase { |
240 class SmartGraph : public ClearableSmartGraphBase { |
243 public: |
241 public: |
244 /// Finds an edge between two nodes. |
242 /// Finds an edge between two nodes. |
245 |
243 |
356 MappableUndirGraphExtender< |
354 MappableUndirGraphExtender< |
357 IterableUndirGraphExtender< |
355 IterableUndirGraphExtender< |
358 AlterableUndirGraphExtender< |
356 AlterableUndirGraphExtender< |
359 UndirGraphExtender<SmartGraphBase> > > > > > UndirSmartGraphBase; |
357 UndirGraphExtender<SmartGraphBase> > > > > > UndirSmartGraphBase; |
360 |
358 |
|
359 ///A smart undirected graph class. |
|
360 |
|
361 ///This is a simple and fast undirected graph implementation. |
|
362 ///It is also quite memory efficient, but at the price |
|
363 ///that <b> it does support only limited (only stack-like) |
|
364 ///node and edge deletions</b>. |
|
365 ///Except from this it conforms to |
|
366 ///the \ref concept::UndirGraph "UndirGraph" concept. |
|
367 ///\sa concept::UndirGraph. |
|
368 /// |
|
369 ///\todo SnapShot hasn't been implemented yet. |
|
370 /// |
361 class UndirSmartGraph : public UndirSmartGraphBase { |
371 class UndirSmartGraph : public UndirSmartGraphBase { |
362 }; |
372 }; |
363 |
373 |
364 |
374 |
365 /// @} |
375 /// @} |