1.1 --- a/lemon/smart_graph.h	Fri Nov 04 15:52:24 2005 +0000
     1.2 +++ b/lemon/smart_graph.h	Fri Nov 04 15:59:21 2005 +0000
     1.3 @@ -214,14 +214,6 @@
     1.4        edge.n = edges[edge.n].next_in;
     1.5      }
     1.6  
     1.7 -    Edge _findEdge(Node u,Node v, Edge prev = INVALID) 
     1.8 -    {
     1.9 -      int e = (prev.n==-1)? nodes[u.n].first_out : edges[prev.n].next_out;
    1.10 -      while(e!=-1 && edges[e].target!=v.n) e = edges[e].next_out;
    1.11 -      prev.n=e;
    1.12 -      return prev;
    1.13 -    }
    1.14 -
    1.15      Node _split(Node n, bool connect = true)
    1.16      {
    1.17        Node b = addNode();
    1.18 @@ -256,26 +248,6 @@
    1.19    ///\author Alpar Juttner
    1.20    class SmartGraph : public ExtendedSmartGraphBase {
    1.21    public:
    1.22 -    /// Finds an edge between two nodes.
    1.23 -    
    1.24 -    /// Finds an edge from node \c u to node \c v.
    1.25 -    ///
    1.26 -    /// If \c prev is \ref INVALID (this is the default value), then
    1.27 -    /// it finds the first edge from \c u to \c v. Otherwise it looks for
    1.28 -    /// the next edge from \c u to \c v after \c prev.
    1.29 -    /// \return The found edge or \ref INVALID if there is no such an edge.
    1.30 -    ///
    1.31 -    /// Thus you can iterate through each edge from \c u to \c v as it follows.
    1.32 -    /// \code
    1.33 -    /// for(Edge e=G.findEdge(u,v);e!=INVALID;e=G.findEdge(u,v,e)) {
    1.34 -    ///   ...
    1.35 -    /// }
    1.36 -    /// \endcode
    1.37 -    /// \todo Possibly it should be a global function.
    1.38 -    Edge findEdge(Node u,Node v, Edge prev = INVALID) 
    1.39 -    {
    1.40 -      return _findEdge(u,v,prev);
    1.41 -    }
    1.42      
    1.43      class SnapShot;
    1.44      friend class SnapShot;