Index: adjacency_list.hpp
===================================================================
RCS file: /cvsroot/boost/boost/boost/graph/detail/adjacency_list.hpp,v
retrieving revision 1.130
diff -u -5 -p -r1.130 adjacency_list.hpp
--- adjacency_list.hpp	15 Dec 2004 20:32:23 -0000	1.130
+++ adjacency_list.hpp	16 Dec 2004 13:16:24 -0000
@@ -367,10 +367,24 @@ namespace boost {
     //=========================================================================
     // Directed Edges Helper Class
 
     namespace detail {
 
+      // O(E/V)
+      template <class edge_descriptor, class EdgeList, class StoredProperty>
+      inline void
+      remove_directed_edge_dispatch(edge_descriptor, EdgeList& el,
+                                    StoredProperty& p)
+      {
+        for (typename EdgeList::iterator i = el.begin();
+             i != el.end(); ++i)
+          if (&(*i).get_property() == &p) {
+            el.erase(i);
+            return;
+          }
+      }
+
       template <class incidence_iterator, class EdgeList, class Predicate>
       inline void
       remove_directed_edge_if_dispatch(incidence_iterator first,
                                        incidence_iterator last, 
                                        EdgeList& el, Predicate pred,
@@ -478,24 +492,10 @@ namespace boost {
       }
 
       // O(E/V)
       template <class edge_descriptor, class EdgeList, class StoredProperty>
       inline void
-      remove_directed_edge_dispatch(edge_descriptor, EdgeList& el,
-                                    StoredProperty& p)
-      {
-        for (typename EdgeList::iterator i = el.begin();
-             i != el.end(); ++i)
-          if (&(*i).get_property() == &p) {
-            el.erase(i);
-            return;
-          }
-      }
-
-      // O(E/V)
-      template <class edge_descriptor, class EdgeList, class StoredProperty>
-      inline void
       remove_directed_edge_dispatch(edge_descriptor e, EdgeList& el,
                                     no_property&)
       {
         for (typename EdgeList::iterator i = el.begin();
              i != el.end(); ++i)