1.1 --- a/lemon/bits/erasable_graph_extender.h	Wed Feb 22 12:45:59 2006 +0000
     1.2 +++ /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.3 @@ -1,138 +0,0 @@
     1.4 -/* -*- C++ -*-
     1.5 - *
     1.6 - * This file is a part of LEMON, a generic C++ optimization library
     1.7 - *
     1.8 - * Copyright (C) 2003-2006
     1.9 - * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10 - * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11 - *
    1.12 - * Permission to use, modify and distribute this software is granted
    1.13 - * provided that this copyright notice appears in all copies. For
    1.14 - * precise terms see the accompanying LICENSE file.
    1.15 - *
    1.16 - * This software is provided "AS IS" with no warranty of any kind,
    1.17 - * express or implied, and with no claim as to its suitability for any
    1.18 - * purpose.
    1.19 - *
    1.20 - */
    1.21 -
    1.22 -#ifndef LEMON_ERASABLE_GRAPH_EXTENDER_H
    1.23 -#define LEMON_ERASABLE_GRAPH_EXTENDER_H
    1.24 -
    1.25 -#include <vector>
    1.26 -
    1.27 -#include <lemon/invalid.h>
    1.28 -
    1.29 -
    1.30 -namespace lemon {
    1.31 -
    1.32 -  template <typename _Base> 
    1.33 -  class ErasableGraphExtender : public _Base {
    1.34 -  public:
    1.35 -
    1.36 -    typedef ErasableGraphExtender Graph;
    1.37 -    typedef _Base Parent;
    1.38 -
    1.39 -    typedef typename Parent::Node Node;
    1.40 -    typedef typename Parent::Edge Edge;
    1.41 -
    1.42 -    void erase(const Node& node) {
    1.43 -      Edge edge;
    1.44 -      Parent::firstOut(edge, node);
    1.45 -      while (edge != INVALID ) {
    1.46 -	erase(edge);
    1.47 -	Parent::firstOut(edge, node);
    1.48 -      } 
    1.49 -
    1.50 -      Parent::firstIn(edge, node);
    1.51 -      while (edge != INVALID ) {
    1.52 -	erase(edge);
    1.53 -	Parent::firstIn(edge, node);
    1.54 -      }
    1.55 -
    1.56 -      Parent::getNotifier(Node()).erase(node);
    1.57 -      Parent::erase(node);
    1.58 -    }
    1.59 -    
    1.60 -    void erase(const Edge& edge) {
    1.61 -      Parent::getNotifier(Edge()).erase(edge);
    1.62 -      Parent::erase(edge);
    1.63 -    }
    1.64 -
    1.65 -  };
    1.66 -
    1.67 -  template <typename _Base> 
    1.68 -  class ErasableEdgeSetExtender : public _Base {
    1.69 -  public:
    1.70 -
    1.71 -    typedef ErasableEdgeSetExtender Graph;
    1.72 -    typedef _Base Parent;
    1.73 -
    1.74 -    typedef typename Parent::Edge Edge;
    1.75 -
    1.76 -    void erase(const Edge& edge) {
    1.77 -      Parent::getNotifier(Edge()).erase(edge);
    1.78 -      Parent::erase(edge);
    1.79 -    }
    1.80 -
    1.81 -  };
    1.82 -
    1.83 -  template <typename _Base> 
    1.84 -  class ErasableUGraphExtender : public _Base {
    1.85 -  public:
    1.86 -
    1.87 -    typedef ErasableUGraphExtender Graph;
    1.88 -    typedef _Base Parent;
    1.89 -
    1.90 -    typedef typename Parent::Node Node;
    1.91 -    typedef typename Parent::UEdge UEdge;
    1.92 -    typedef typename Parent::Edge Edge;
    1.93 -
    1.94 -    void erase(const Node& node) {
    1.95 -      Edge edge;
    1.96 -      Parent::firstOut(edge, node);
    1.97 -      while (edge != INVALID ) {
    1.98 -	erase(edge);
    1.99 -	Parent::firstOut(edge, node);
   1.100 -      } 
   1.101 -
   1.102 -      Parent::getNotifier(Node()).erase(node);
   1.103 -      Parent::erase(node);
   1.104 -    }
   1.105 -    
   1.106 -    void erase(const UEdge& uedge) {
   1.107 -      std::vector<Edge> edges;
   1.108 -      edges.push_back(Parent::direct(uedge,true));
   1.109 -      edges.push_back(Parent::direct(uedge,false));
   1.110 -      Parent::getNotifier(Edge()).erase(edges);
   1.111 -      Parent::getNotifier(UEdge()).erase(uedge);
   1.112 -      Parent::erase(uedge);
   1.113 -    }
   1.114 -
   1.115 -  };
   1.116 -
   1.117 -  template <typename _Base> 
   1.118 -  class ErasableUEdgeSetExtender : public _Base {
   1.119 -  public:
   1.120 -
   1.121 -    typedef ErasableUEdgeSetExtender Graph;
   1.122 -    typedef _Base Parent;
   1.123 -
   1.124 -    typedef typename Parent::Node Node;
   1.125 -    typedef typename Parent::UEdge UEdge;
   1.126 -    typedef typename Parent::Edge Edge;
   1.127 -
   1.128 -    void erase(const UEdge& uedge) {
   1.129 -      std::vector<Edge> edges;
   1.130 -      edges.push_back(Parent::direct(uedge,true));
   1.131 -      edges.push_back(Parent::direct(uedge,false));
   1.132 -      Parent::getNotifier(Edge()).erase(edges);
   1.133 -      Parent::getNotifier(UEdge()).erase(uedge);
   1.134 -      Parent::erase(uedge);
   1.135 -    }
   1.136 -
   1.137 -  };
   1.138 -
   1.139 -}
   1.140 -
   1.141 -#endif