1.1 --- a/lemon/concept/bpugraph.h	Mon Jun 26 15:40:35 2006 +0000
     1.2 +++ b/lemon/concept/bpugraph.h	Wed Jun 28 15:06:24 2006 +0000
     1.3 @@ -947,70 +947,6 @@
     1.4  
     1.5      };
     1.6  
     1.7 -    /// \brief An empty non-static undirected graph class.
     1.8 -    ///    
     1.9 -    /// This class provides everything that \ref BpUGraph does.
    1.10 -    /// Additionally it enables building graphs from scratch.
    1.11 -    class ExtendableBpUGraph : public BpUGraph {
    1.12 -    public:
    1.13 -      
    1.14 -      /// \brief Add a new ANode to the graph.
    1.15 -      ///
    1.16 -      /// Add a new ANode to the graph.
    1.17 -      /// \return the new node.
    1.18 -      Node addANode();
    1.19 -
    1.20 -      /// \brief Add a new ANode to the graph.
    1.21 -      ///
    1.22 -      /// Add a new ANode to the graph.
    1.23 -      /// \return the new node.
    1.24 -      Node addBNode();
    1.25 -
    1.26 -      /// \brief Add a new undirected edge to the graph.
    1.27 -      ///
    1.28 -      /// Add a new undirected edge to the graph. One of the nodes
    1.29 -      /// should be ANode and the other should be BNode.
    1.30 -      /// \pre The nodes are not in the same nodeset.
    1.31 -      /// \return the new edge.
    1.32 -      UEdge addEdge(const Node& from, const Node& to);
    1.33 -
    1.34 -      /// \brief Resets the graph.
    1.35 -      ///
    1.36 -      /// This function deletes all undirected edges and nodes of the graph.
    1.37 -      /// It also frees the memory allocated to store them.
    1.38 -      void clear() { }
    1.39 -
    1.40 -      template <typename Graph>
    1.41 -      struct Constraints {
    1.42 -	void constraints() {}
    1.43 -      };
    1.44 -
    1.45 -    };
    1.46 -
    1.47 -    /// \brief An empty erasable undirected graph class.
    1.48 -    ///
    1.49 -    /// This class is an extension of \ref ExtendableBpUGraph. It makes it
    1.50 -    /// possible to erase undirected edges or nodes.
    1.51 -    class ErasableBpUGraph : public ExtendableBpUGraph {
    1.52 -    public:
    1.53 -
    1.54 -      /// \brief Deletes a node.
    1.55 -      ///
    1.56 -      /// Deletes a node.
    1.57 -      ///
    1.58 -      void erase(Node) { }
    1.59 -      /// \brief Deletes an undirected edge.
    1.60 -      ///
    1.61 -      /// Deletes an undirected edge.
    1.62 -      ///
    1.63 -      void erase(UEdge) { }
    1.64 -
    1.65 -      template <typename Graph>
    1.66 -      struct Constraints {
    1.67 -	void constraints() {}
    1.68 -      };
    1.69 -
    1.70 -    };
    1.71  
    1.72      /// @}
    1.73