COIN-OR::LEMON - Graph Library

Changeset 332:5dc61ba30730 in lemon-0.x


Ignore:
Timestamp:
04/15/04 21:01:00 (16 years ago)
Author:
marci
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@451
Message:

.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/work/marci/graph_concept.h

    r325 r332  
    44
    55///\file
    6 ///\brief Declaration of GraphSkeleton.
     6///\brief Declaration of GraphSkeleturo.
    77
    88#include <invalid.h>
     
    1111namespace hugo {
    1212
    13   // @defgroup empty_graph The GraphSkeleton class
    14   // @{
     13  /// @defgroup empty_graph The GraphSkeleturo class
     14  /// @{
    1515
    1616  /// An empty graph class.
     
    2929  /// like @ref ListGraph or
    3030  /// @ref SmartGraph will just refer to this structure.
    31   class GraphSkeleton
     31  class GraphSkeleturo
    3232  {
    3333  public:
    3434    /// Defalult constructor.
    35     GraphSkeleton() {}
     35    GraphSkeleturo() {}
    3636    ///Copy consructor.
    3737
    3838    ///\todo It is not clear, what we expect from a copy constructor.
    3939    ///E.g. How to assign the nodes/edges to each other? What about maps?
    40     GraphSkeleton(const GraphSkeleton &G) {}
     40    GraphSkeleturo(const GraphSkeleturo &G) {}
    4141
    4242    /// The base type of the node iterators.
     
    8888      NodeIt(Invalid) {}
    8989      /// Sets the iterator to the first node of \c G.
    90       NodeIt(const GraphSkeleton &G) {}
     90      NodeIt(const GraphSkeleturo &G) {}
    9191      /// @warning The default constructor sets the iterator
    9292      /// to an undefined value.
     
    135135      ///@param n the node
    136136      ///@param G the graph
    137       OutEdgeIt(const GraphSkeleton & G, Node n) {}
     137      OutEdgeIt(const GraphSkeleturo & G, Node n) {}
    138138    };
    139139
     
    157157      /// Initialize the iterator to be invalid
    158158      InEdgeIt(Invalid) {}
    159       InEdgeIt(const GraphSkeleton &, Node) {}   
     159      InEdgeIt(const GraphSkeleturo &, Node) {}   
    160160    };
    161161    //  class SymEdgeIt : public Edge {};
     
    177177      /// Initialize the iterator to be invalid
    178178      EdgeIt(Invalid) {}
    179       EdgeIt(const GraphSkeleton &) {}
     179      EdgeIt(const GraphSkeleturo &) {}
    180180    };
    181181
     
    269269
    270270    ///Read/write/reference map of the nodes to type \c T.
    271     /// \sa MemoryMapSkeleton
     271    /// \sa MemoryMapSkeleturo
    272272    /// \todo We may need copy constructor
    273273    /// \todo We may need conversion from other nodetype
     
    282282      typedef Node KeyType;
    283283
    284       NodeMap(const GraphSkeleton &G) {}
    285       NodeMap(const GraphSkeleton &G, T t) {}
     284      NodeMap(const GraphSkeleturo &G) {}
     285      NodeMap(const GraphSkeleturo &G, T t) {}
    286286
    287287      template<typename TT> NodeMap(const NodeMap<TT> &m) {}
     
    310310    ///It behaves exactly in the same way as \ref NodeMap.
    311311    /// \sa NodeMap
    312     /// \sa MemoryMapSkeleton
     312    /// \sa MemoryMapSkeleturo
    313313    /// \todo We may need copy constructor
    314314    /// \todo We may need conversion from other edgetype
     
    320320      typedef Edge KeyType;
    321321
    322       EdgeMap(const GraphSkeleton &G) {}
    323       EdgeMap(const GraphSkeleton &G, T t) {}
     322      EdgeMap(const GraphSkeleturo &G) {}
     323      EdgeMap(const GraphSkeleturo &G, T t) {}
    324324   
    325325      void set(Edge i, T t) {}
     
    342342  ///
    343343  /// \todo This blabla could be replaced by a sepatate description about
    344   /// Skeletons.
     344  /// Skeleturos.
    345345  ///
    346346  /// It can be used for checking the interface compatibility,
     
    351351  /// like @ref ListGraph or
    352352  /// @ref SmartGraph will just refer to this structure.
    353   class EraseableGraphSkeleton : public GraphSkeleton
     353  class EraseableGraphSkeleturo : public GraphSkeleturo
    354354  {
    355355  public:
     
    360360
    361361    /// Defalult constructor.
    362     GraphSkeleton() {}
     362    GraphSkeleturo() {}
    363363    ///Copy consructor.
    364     GraphSkeleton(const GraphSkeleton &G) {}
     364    GraphSkeleturo(const GraphSkeleturo &G) {}
    365365  };
    366 
    367  
    368   // @}
    369 
    370366
    371367  /// An empty graph class which provides a function to get the number
     
    378374  /// the implementation can be circumstantial, that is why this composes a
    379375  /// separate concept.
    380   class NodeCountingGraphSkeleton
     376  class NodeCountingGraphSkeleturo
    381377  {
    382378  public:
     
    394390  /// the implementation can be circumstantial, that is why this composes a
    395391  /// separate concept.
    396   class EdgeCountingGraphSkeleton
     392  class EdgeCountingGraphSkeleturo
    397393  {
    398394  public:
     
    400396    int edgeNum() const { return 0;}
    401397  };
     398 
     399  /// @}
    402400
    403401} //namespace hugo
    404402
    405403
    406 // class EmptyBipGraph : public Graph Skeleton
     404
     405// class EmptyBipGraph : public Graph Skeleturo
    407406// {
    408407//   class ANode {};
Note: See TracChangeset for help on using the changeset viewer.