diff -r 768ebc700bae -r a2ce3c4780b7 src/work/deba/edge_map_registry.h
--- a/src/work/deba/edge_map_registry.h	Fri Apr 16 13:26:15 2004 +0000
+++ b/src/work/deba/edge_map_registry.h	Fri Apr 16 13:42:03 2004 +0000
@@ -3,20 +3,22 @@
 
 #include <vector>
 
+#include "edge_map_base.h"
+
 template <typename G, typename E>
 class EdgeMapRegistry {
 public:
 	typedef G Graph;
 	typedef E Edge
 	
-	typedef EdgeMapBase<Graph, Edge> EdgeMapBase;
+	typedef EdgeMapBase<Graph, Edge> MapBase;
 
 protected:
 	typedef std::vector<EdgeMapBase*> Container; 
 	
 	Container container;
 	
-	void add(EdgeMapBase& map_base) {
+	void add(MapBase& map_base) {
 		if (map_base.graph) {
 			map_base.graph->edge_maps.erase(map_base);
 		}
@@ -25,7 +27,7 @@
 		map_base.graph_index = container.size()-1;
 	} 
 	
-	void erase(EdgeMapBase& map_base) {
+	void erase(MapBase& map_base) {
 		if (map_base.graph != this) return;
 		container.back()->graph_index = map_base.graph_index; 
 		container[map_base.graph_index] = container.back();
@@ -33,21 +35,21 @@
 		map_base.graph = 0;
 	}
 	
-	void addEdge(Edge& edge) {
+	void add(Edge& edge) {
 		typename Container::iterator it;
 		for (it = container.begin(); it != container.end(); ++it) {
 			(*it)->add(edge);
 		}
 	}
 	
-	void eraseEdge(Edge& edge) {
+	void erase(Edge& edge) {
 		typename Container::iterator it;
 		for (it = container.begin(); it != container.end(); ++it) {
 			(*it)->erase(edge);
 		}
 	}
 
-	friend class EdgeMapBase;
+	friend class MapBase;
 };
 
 #endif