1.1 --- a/lemon/smart_graph.h Thu Jan 26 06:44:22 2006 +0000
1.2 +++ b/lemon/smart_graph.h Thu Jan 26 15:42:13 2006 +0000
1.3 @@ -19,7 +19,7 @@
1.4
1.5 ///\ingroup graphs
1.6 ///\file
1.7 -///\brief SmartGraph and UndirSmartGraph classes.
1.8 +///\brief SmartGraph and SmartUGraph classes.
1.9
1.10 #include <vector>
1.11
1.12 @@ -353,35 +353,37 @@
1.13
1.14 /**************** Undirected List Graph ****************/
1.15
1.16 - typedef ClearableUndirGraphExtender<
1.17 - ExtendableUndirGraphExtender<
1.18 - MappableUndirGraphExtender<
1.19 - IterableUndirGraphExtender<
1.20 - AlterableUndirGraphExtender<
1.21 - UndirGraphExtender<SmartGraphBase> > > > > > ExtendedUndirSmartGraphBase;
1.22 + typedef ClearableUGraphExtender<
1.23 + ExtendableUGraphExtender<
1.24 + MappableUGraphExtender<
1.25 + IterableUGraphExtender<
1.26 + AlterableUGraphExtender<
1.27 + UGraphExtender<SmartGraphBase> > > > > > ExtendedSmartUGraphBase;
1.28
1.29 - ///A smart undirected graph class.
1.30 -
1.31 - ///This is a simple and fast undirected graph implementation.
1.32 - ///It is also quite memory efficient, but at the price
1.33 - ///that <b> it does support only limited (only stack-like)
1.34 - ///node and edge deletions</b>.
1.35 - ///Except from this it conforms to
1.36 - ///the \ref concept::UndirGraph "UndirGraph" concept.
1.37 - ///\sa concept::UndirGraph.
1.38 + /// \ingroup graphs
1.39 ///
1.40 - ///\todo Snapshot hasn't been implemented yet.
1.41 + /// \brief A smart undirected graph class.
1.42 ///
1.43 - class UndirSmartGraph : public ExtendedUndirSmartGraphBase {
1.44 + /// This is a simple and fast undirected graph implementation.
1.45 + /// It is also quite memory efficient, but at the price
1.46 + /// that <b> it does support only limited (only stack-like)
1.47 + /// node and edge deletions</b>.
1.48 + /// Except from this it conforms to
1.49 + /// the \ref concept::UGraph "UGraph" concept.
1.50 + /// \sa concept::UGraph.
1.51 + ///
1.52 + /// \todo Snapshot hasn't been implemented yet.
1.53 + ///
1.54 + class SmartUGraph : public ExtendedSmartUGraphBase {
1.55 };
1.56
1.57
1.58 - class SmartUndirBipartiteGraphBase {
1.59 + class SmartUBipartiteGraphBase {
1.60 public:
1.61
1.62 class NodeSetError : public LogicError {
1.63 virtual const char* exceptionName() const {
1.64 - return "lemon::FullUndirBipartiteGraph::NodeSetError";
1.65 + return "lemon::FullUBipartiteGraph::NodeSetError";
1.66 }
1.67 };
1.68
1.69 @@ -406,7 +408,7 @@
1.70 public:
1.71
1.72 class Node {
1.73 - friend class SmartUndirBipartiteGraphBase;
1.74 + friend class SmartUBipartiteGraphBase;
1.75 protected:
1.76 int id;
1.77
1.78 @@ -420,7 +422,7 @@
1.79 };
1.80
1.81 class Edge {
1.82 - friend class SmartUndirBipartiteGraphBase;
1.83 + friend class SmartUBipartiteGraphBase;
1.84 protected:
1.85 int id;
1.86
1.87 @@ -583,18 +585,18 @@
1.88 };
1.89
1.90
1.91 - typedef ClearableUndirBipartiteGraphExtender<
1.92 - ExtendableUndirBipartiteGraphExtender<
1.93 - MappableUndirBipartiteGraphExtender<
1.94 - IterableUndirBipartiteGraphExtender<
1.95 - AlterableUndirBipartiteGraphExtender<
1.96 - UndirBipartiteGraphExtender <
1.97 - SmartUndirBipartiteGraphBase> > > > > >
1.98 - ExtendedSmartUndirBipartiteGraphBase;
1.99 + typedef ClearableUBipartiteGraphExtender<
1.100 + ExtendableUBipartiteGraphExtender<
1.101 + MappableUBipartiteGraphExtender<
1.102 + IterableUBipartiteGraphExtender<
1.103 + AlterableUBipartiteGraphExtender<
1.104 + UBipartiteGraphExtender <
1.105 + SmartUBipartiteGraphBase> > > > > >
1.106 + ExtendedSmartUBipartiteGraphBase;
1.107
1.108
1.109 - class SmartUndirBipartiteGraph :
1.110 - public ExtendedSmartUndirBipartiteGraphBase {
1.111 + class SmartUBipartiteGraph :
1.112 + public ExtendedSmartUBipartiteGraphBase {
1.113 };
1.114
1.115