COIN-OR::LEMON - Graph Library

Changeset 826:056fbb112b30 in lemon-0.x


Ignore:
Timestamp:
09/09/04 11:18:41 (15 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1122
Message:

Spell checking (Ereasable ->Erasable), affected also the code.

Location:
src
Files:
5 edited

Legend:

Unmodified
Added
Removed
  • src/hugo/skeletons/graph.h

    r801 r826  
    457457      /// This function deletes all edges and nodes of the graph.
    458458      /// It also frees the memory allocated to store them.
    459       /// \todo It might belong to \c EraseableGraphSkeleton.
     459      /// \todo It might belong to \c ErasableGraphSkeleton.
    460460      void clear() { }
    461461    };
    462462
    463     /// An empty eraseable graph class.
     463    /// An empty erasable graph class.
    464464 
    465465    /// This class is an extension of \c GraphSkeleton. It also makes it
    466466    /// possible to erase edges or nodes.
    467     class EraseableGraphSkeleton : public GraphSkeleton
     467    class ErasableGraphSkeleton : public GraphSkeleton
    468468    {
    469469    public:
     
    472472      /// Defalult constructor.
    473473      ///
    474       EraseableGraphSkeleton() { }
     474      ErasableGraphSkeleton() { }
    475475      /// Deletes a node.
    476476
  • src/test/graph_test.cc

    r800 r826  
    5959(skeleton::GraphSkeleton &);
    6060
    61 template void checkCompileErasableGraph<skeleton::EraseableGraphSkeleton>
    62 (skeleton::EraseableGraphSkeleton &);
     61template void checkCompileErasableGraph<skeleton::ErasableGraphSkeleton>
     62(skeleton::ErasableGraphSkeleton &);
    6363
    6464//Compile SmartGraph
  • src/work/marci/graph_concept.h

    r652 r826  
    400400
    401401
    402   /// \brief Node-eraseable graph concept.
     402  /// \brief Node-erasable graph concept.
    403403  ///
    404404  /// A graph class which provides a function to
    405405  /// delete any of its nodes.
    406   class NodeEraseableGraphConcept : virtual public GraphConcept
     406  class NodeErasableGraphConcept : virtual public GraphConcept
    407407  {
    408408  public:
     
    412412
    413413
    414   /// \brief Edge-eraseable graph concept.
     414  /// \brief Edge-erasable graph concept.
    415415  ///
    416416  /// A graph class which provides a function to delete any
    417417  /// of its edges.
    418   class EdgeEraseableGraphConcept : virtual public GraphConcept
     418  class EdgeErasableGraphConcept : virtual public GraphConcept
    419419  {
    420420  public:
  • src/work/peter/edgepathgraph.h

    r677 r826  
    365365  };
    366366
    367   /// An empty eraseable graph class.
     367  /// An empty erasable graph class.
    368368 
    369   /// This class provides all the common features of an \e eraseable graph
     369  /// This class provides all the common features of an \e erasable graph
    370370  /// structure,
    371371  /// however completely without implementations and real data structures
     
    385385  /// @ref SmartGraph will just refer to this structure.
    386386  template <typename P, typename Gact, typename Gsub>
    387   class EraseableEdgePathGraph : public EdgePathGraph<P, Gact, Gsub>
     387  class ErasableEdgePathGraph : public EdgePathGraph<P, Gact, Gsub>
    388388  {
    389389  public:
     
    394394
    395395    /// Defalult constructor.
    396     EraseableEdgePathGraph() {}
     396    ErasableEdgePathGraph() {}
    397397    ///Copy consructor.
    398     EraseableEdgePathGraph(const EdgePathGraph<P, Gact, Gsub> &EPG) {}
     398    ErasableEdgePathGraph(const EdgePathGraph<P, Gact, Gsub> &EPG) {}
    399399  };
    400400
  • src/work/peter/hierarchygraph.h

    r691 r826  
    528528  };
    529529
    530   /// An empty eraseable graph class.
    531 
    532   /// This class provides all the common features of an \e eraseable graph
     530  /// An empty erasable graph class.
     531
     532  /// This class provides all the common features of an \e erasable graph
    533533  /// structure,
    534534  /// however completely without implementations and real data structures
     
    547547  /// like @ref ListGraph or
    548548  /// @ref SmartGraph will just refer to this structure.
    549 template < typename Gact, typename Gsub > class EraseableHierarchyGraph:public HierarchyGraph < Gact,
     549template < typename Gact, typename Gsub > class ErasableHierarchyGraph:public HierarchyGraph < Gact,
    550550    Gsub
    551551    >
     
    564564
    565565    /// Defalult constructor.
    566     EraseableHierarchyGraph ()
     566    ErasableHierarchyGraph ()
    567567    {
    568568    }
    569569    ///Copy consructor.
    570     EraseableHierarchyGraph (const HierarchyGraph < Gact, Gsub > &EPG)
     570    ErasableHierarchyGraph (const HierarchyGraph < Gact, Gsub > &EPG)
    571571    {
    572572    }
Note: See TracChangeset for help on using the changeset viewer.