diff -r e225719bde6b -r 2d806130e700 lemon/full_graph.h
--- a/lemon/full_graph.h	Thu Jan 26 06:44:22 2006 +0000
+++ b/lemon/full_graph.h	Thu Jan 26 15:42:13 2006 +0000
@@ -31,7 +31,7 @@
 
 ///\ingroup graphs
 ///\file
-///\brief FullGraph and UndirFullGraph classes.
+///\brief FullGraph and FullUGraph classes.
 
 
 namespace lemon {
@@ -213,19 +213,19 @@
   };
 
 
-  class UndirFullGraphBase {
+  class FullUGraphBase {
     int _nodeNum;
     int _edgeNum;
   public:
 
-    typedef UndirFullGraphBase Graph;
+    typedef FullUGraphBase Graph;
 
     class Node;
     class Edge;
 
   public:
 
-    UndirFullGraphBase() {}
+    FullUGraphBase() {}
 
 
     ///Creates a full graph with \c n nodes.
@@ -301,7 +301,7 @@
     
       
     class Node {
-      friend class UndirFullGraphBase;
+      friend class FullUGraphBase;
 
     protected:
       int id;
@@ -317,7 +317,7 @@
 
 
     class Edge {
-      friend class UndirFullGraphBase;
+      friend class FullUGraphBase;
       
     protected:
       int id;  // _nodeNum * target + source;
@@ -377,10 +377,10 @@
 
   };
 
-  typedef StaticMappableUndirGraphExtender<
-    IterableUndirGraphExtender<
-    AlterableUndirGraphExtender<
-    UndirGraphExtender<UndirFullGraphBase> > > > ExtendedUndirFullGraphBase;
+  typedef StaticMappableUGraphExtender<
+    IterableUGraphExtender<
+    AlterableUGraphExtender<
+    UGraphExtender<FullUGraphBase> > > > ExtendedFullUGraphBase;
 
   /// \ingroup graphs
   ///
@@ -390,20 +390,20 @@
   /// It is completely static, so you can neither add nor delete either
   /// edges or nodes.
   ///
-  /// The main difference beetween the \e FullGraph and \e UndirFullGraph class
+  /// The main difference beetween the \e FullGraph and \e FullUGraph class
   /// is that this class conforms to the undirected graph concept and
   /// it does not contain the loop edges.
   ///
   /// \sa FullGraph
   ///
   /// \author Balazs Dezso
-  class UndirFullGraph : public ExtendedUndirFullGraphBase {
+  class FullUGraph : public ExtendedFullUGraphBase {
   public:
-    UndirFullGraph(int n) { construct(n); }
+    FullUGraph(int n) { construct(n); }
   };
 
 
-  class FullUndirBipartiteGraphBase {
+  class FullUBipartiteGraphBase {
   protected:
 
     int _upperNodeNum;
@@ -415,12 +415,12 @@
 
     class NodeSetError : public LogicError {
       virtual const char* exceptionName() const { 
-	return "lemon::FullUndirBipartiteGraph::NodeSetError";
+	return "lemon::FullUBipartiteGraph::NodeSetError";
       }
     };
   
     class Node {
-      friend class FullUndirBipartiteGraphBase;
+      friend class FullUBipartiteGraphBase;
     protected:
       int id;
 
@@ -434,7 +434,7 @@
     };
 
     class Edge {
-      friend class FullUndirBipartiteGraphBase;
+      friend class FullUBipartiteGraphBase;
     protected:
       int id;
 
@@ -575,19 +575,19 @@
   };
 
 
-  typedef StaticMappableUndirBipartiteGraphExtender<
-    IterableUndirBipartiteGraphExtender<
-    AlterableUndirBipartiteGraphExtender<
-    UndirBipartiteGraphExtender <
-    FullUndirBipartiteGraphBase> > > >
-  ExtendedFullUndirBipartiteGraphBase;
+  typedef StaticMappableUBipartiteGraphExtender<
+    IterableUBipartiteGraphExtender<
+    AlterableUBipartiteGraphExtender<
+    UBipartiteGraphExtender <
+    FullUBipartiteGraphBase> > > >
+  ExtendedFullUBipartiteGraphBase;
 
 
-  class FullUndirBipartiteGraph : 
-    public ExtendedFullUndirBipartiteGraphBase {
+  class FullUBipartiteGraph : 
+    public ExtendedFullUBipartiteGraphBase {
   public:
-    typedef ExtendedFullUndirBipartiteGraphBase Parent;
-    FullUndirBipartiteGraph(int upperNodeNum, int lowerNodeNum) {
+    typedef ExtendedFullUBipartiteGraphBase Parent;
+    FullUBipartiteGraph(int upperNodeNum, int lowerNodeNum) {
       Parent::construct(upperNodeNum, lowerNodeNum);
     }
   };