Changeset 1909:2d806130e700 in lemon-0.x for lemon/smart_graph.h
- Timestamp:
- 01/26/06 16:42:13 (18 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2484
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/smart_graph.h
r1875 r1909 20 20 ///\ingroup graphs 21 21 ///\file 22 ///\brief SmartGraph and UndirSmartGraph classes.22 ///\brief SmartGraph and SmartUGraph classes. 23 23 24 24 #include <vector> … … 354 354 /**************** Undirected List Graph ****************/ 355 355 356 typedef ClearableUndirGraphExtender< 357 ExtendableUndirGraphExtender< 358 MappableUndirGraphExtender< 359 IterableUndirGraphExtender< 360 AlterableUndirGraphExtender< 361 UndirGraphExtender<SmartGraphBase> > > > > > ExtendedUndirSmartGraphBase; 362 363 ///A smart undirected graph class. 364 365 ///This is a simple and fast undirected graph implementation. 366 ///It is also quite memory efficient, but at the price 367 ///that <b> it does support only limited (only stack-like) 368 ///node and edge deletions</b>. 369 ///Except from this it conforms to 370 ///the \ref concept::UndirGraph "UndirGraph" concept. 371 ///\sa concept::UndirGraph. 356 typedef ClearableUGraphExtender< 357 ExtendableUGraphExtender< 358 MappableUGraphExtender< 359 IterableUGraphExtender< 360 AlterableUGraphExtender< 361 UGraphExtender<SmartGraphBase> > > > > > ExtendedSmartUGraphBase; 362 363 /// \ingroup graphs 372 364 /// 373 /// \todo Snapshot hasn't been implemented yet.365 /// \brief A smart undirected graph class. 374 366 /// 375 class UndirSmartGraph : public ExtendedUndirSmartGraphBase { 367 /// This is a simple and fast undirected graph implementation. 368 /// It is also quite memory efficient, but at the price 369 /// that <b> it does support only limited (only stack-like) 370 /// node and edge deletions</b>. 371 /// Except from this it conforms to 372 /// the \ref concept::UGraph "UGraph" concept. 373 /// \sa concept::UGraph. 374 /// 375 /// \todo Snapshot hasn't been implemented yet. 376 /// 377 class SmartUGraph : public ExtendedSmartUGraphBase { 376 378 }; 377 379 378 380 379 class SmartU ndirBipartiteGraphBase {381 class SmartUBipartiteGraphBase { 380 382 public: 381 383 382 384 class NodeSetError : public LogicError { 383 385 virtual const char* exceptionName() const { 384 return "lemon::FullU ndirBipartiteGraph::NodeSetError";386 return "lemon::FullUBipartiteGraph::NodeSetError"; 385 387 } 386 388 }; … … 407 409 408 410 class Node { 409 friend class SmartU ndirBipartiteGraphBase;411 friend class SmartUBipartiteGraphBase; 410 412 protected: 411 413 int id; … … 421 423 422 424 class Edge { 423 friend class SmartU ndirBipartiteGraphBase;425 friend class SmartUBipartiteGraphBase; 424 426 protected: 425 427 int id; … … 584 586 585 587 586 typedef ClearableU ndirBipartiteGraphExtender<587 ExtendableU ndirBipartiteGraphExtender<588 MappableU ndirBipartiteGraphExtender<589 IterableU ndirBipartiteGraphExtender<590 AlterableU ndirBipartiteGraphExtender<591 U ndirBipartiteGraphExtender <592 SmartU ndirBipartiteGraphBase> > > > > >593 ExtendedSmartU ndirBipartiteGraphBase;594 595 596 class SmartU ndirBipartiteGraph :597 public ExtendedSmartU ndirBipartiteGraphBase {588 typedef ClearableUBipartiteGraphExtender< 589 ExtendableUBipartiteGraphExtender< 590 MappableUBipartiteGraphExtender< 591 IterableUBipartiteGraphExtender< 592 AlterableUBipartiteGraphExtender< 593 UBipartiteGraphExtender < 594 SmartUBipartiteGraphBase> > > > > > 595 ExtendedSmartUBipartiteGraphBase; 596 597 598 class SmartUBipartiteGraph : 599 public ExtendedSmartUBipartiteGraphBase { 598 600 }; 599 601
Note: See TracChangeset
for help on using the changeset viewer.