diff -r e225719bde6b -r 2d806130e700 lemon/smart_graph.h
--- a/lemon/smart_graph.h	Thu Jan 26 06:44:22 2006 +0000
+++ b/lemon/smart_graph.h	Thu Jan 26 15:42:13 2006 +0000
@@ -19,7 +19,7 @@
 
 ///\ingroup graphs
 ///\file
-///\brief SmartGraph and UndirSmartGraph classes.
+///\brief SmartGraph and SmartUGraph classes.
 
 #include <vector>
 
@@ -353,35 +353,37 @@
 
   /**************** Undirected List Graph ****************/
 
-  typedef ClearableUndirGraphExtender<
-    ExtendableUndirGraphExtender<
-    MappableUndirGraphExtender<
-    IterableUndirGraphExtender<
-    AlterableUndirGraphExtender<
-    UndirGraphExtender<SmartGraphBase> > > > > > ExtendedUndirSmartGraphBase;
+  typedef ClearableUGraphExtender<
+    ExtendableUGraphExtender<
+    MappableUGraphExtender<
+    IterableUGraphExtender<
+    AlterableUGraphExtender<
+    UGraphExtender<SmartGraphBase> > > > > > ExtendedSmartUGraphBase;
 
-  ///A smart undirected graph class.
-
-  ///This is a simple and fast undirected graph implementation.
-  ///It is also quite memory efficient, but at the price
-  ///that <b> it does support only limited (only stack-like)
-  ///node and edge deletions</b>.
-  ///Except from this it conforms to 
-  ///the \ref concept::UndirGraph "UndirGraph" concept.
-  ///\sa concept::UndirGraph.
+  /// \ingroup graphs
   ///
-  ///\todo Snapshot hasn't been implemented yet.
+  /// \brief A smart undirected graph class.
   ///
-  class UndirSmartGraph : public ExtendedUndirSmartGraphBase {
+  /// This is a simple and fast undirected graph implementation.
+  /// It is also quite memory efficient, but at the price
+  /// that <b> it does support only limited (only stack-like)
+  /// node and edge deletions</b>.
+  /// Except from this it conforms to 
+  /// the \ref concept::UGraph "UGraph" concept.
+  /// \sa concept::UGraph.
+  ///
+  /// \todo Snapshot hasn't been implemented yet.
+  ///
+  class SmartUGraph : public ExtendedSmartUGraphBase {
   };
 
 
-  class SmartUndirBipartiteGraphBase {
+  class SmartUBipartiteGraphBase {
   public:
 
     class NodeSetError : public LogicError {
       virtual const char* exceptionName() const { 
-	return "lemon::FullUndirBipartiteGraph::NodeSetError";
+	return "lemon::FullUBipartiteGraph::NodeSetError";
       }
     };
 
@@ -406,7 +408,7 @@
   public:
   
     class Node {
-      friend class SmartUndirBipartiteGraphBase;
+      friend class SmartUBipartiteGraphBase;
     protected:
       int id;
 
@@ -420,7 +422,7 @@
     };
 
     class Edge {
-      friend class SmartUndirBipartiteGraphBase;
+      friend class SmartUBipartiteGraphBase;
     protected:
       int id;
 
@@ -583,18 +585,18 @@
   };
 
 
-  typedef ClearableUndirBipartiteGraphExtender<
-    ExtendableUndirBipartiteGraphExtender<
-    MappableUndirBipartiteGraphExtender<
-    IterableUndirBipartiteGraphExtender<
-    AlterableUndirBipartiteGraphExtender<
-    UndirBipartiteGraphExtender <
-    SmartUndirBipartiteGraphBase> > > > > >
-  ExtendedSmartUndirBipartiteGraphBase;
+  typedef ClearableUBipartiteGraphExtender<
+    ExtendableUBipartiteGraphExtender<
+    MappableUBipartiteGraphExtender<
+    IterableUBipartiteGraphExtender<
+    AlterableUBipartiteGraphExtender<
+    UBipartiteGraphExtender <
+    SmartUBipartiteGraphBase> > > > > >
+  ExtendedSmartUBipartiteGraphBase;
 
 
-  class SmartUndirBipartiteGraph : 
-    public ExtendedSmartUndirBipartiteGraphBase {
+  class SmartUBipartiteGraph : 
+    public ExtendedSmartUBipartiteGraphBase {
   };