# HG changeset patch
# User deba
# Date 1131119961 0
# Node ID 1e2e0238e7c8dc38f5f646b93d2c6e7d406a66d8
# Parent  58455e2aa13e64297f57fb20fa55462427d8d939
Removing findEdge

diff -r 58455e2aa13e -r 1e2e0238e7c8 lemon/smart_graph.h
--- a/lemon/smart_graph.h	Fri Nov 04 15:52:24 2005 +0000
+++ b/lemon/smart_graph.h	Fri Nov 04 15:59:21 2005 +0000
@@ -214,14 +214,6 @@
       edge.n = edges[edge.n].next_in;
     }
 
-    Edge _findEdge(Node u,Node v, Edge prev = INVALID) 
-    {
-      int e = (prev.n==-1)? nodes[u.n].first_out : edges[prev.n].next_out;
-      while(e!=-1 && edges[e].target!=v.n) e = edges[e].next_out;
-      prev.n=e;
-      return prev;
-    }
-
     Node _split(Node n, bool connect = true)
     {
       Node b = addNode();
@@ -256,26 +248,6 @@
   ///\author Alpar Juttner
   class SmartGraph : public ExtendedSmartGraphBase {
   public:
-    /// Finds an edge between two nodes.
-    
-    /// Finds an edge from node \c u to node \c v.
-    ///
-    /// If \c prev is \ref INVALID (this is the default value), then
-    /// it finds the first edge from \c u to \c v. Otherwise it looks for
-    /// the next edge from \c u to \c v after \c prev.
-    /// \return The found edge or \ref INVALID if there is no such an edge.
-    ///
-    /// Thus you can iterate through each edge from \c u to \c v as it follows.
-    /// \code
-    /// for(Edge e=G.findEdge(u,v);e!=INVALID;e=G.findEdge(u,v,e)) {
-    ///   ...
-    /// }
-    /// \endcode
-    /// \todo Possibly it should be a global function.
-    Edge findEdge(Node u,Node v, Edge prev = INVALID) 
-    {
-      return _findEdge(u,v,prev);
-    }
     
     class SnapShot;
     friend class SnapShot;