lemon/concept/sym_graph.h
changeset 1526 8c14aa8f27a2
parent 1435 8e85e6bbefdf
child 1527 7ceab500e1f6
equal deleted inserted replaced
0:d71eefff1cd8 1:cea6b27481b3
    34     /// An empty static graph class.
    34     /// An empty static graph class.
    35   
    35   
    36     /// This class provides all the common features of a symmetric
    36     /// This class provides all the common features of a symmetric
    37     /// graph structure, however completely without implementations and 
    37     /// graph structure, however completely without implementations and 
    38     /// real data structures behind the interface.
    38     /// real data structures behind the interface.
    39     /// All graph algorithms should compile with this class, but it will not
    39     /// All graph algorithms should compile with this class, but they will not
    40     /// run properly, of course.
    40     /// run properly, of course.
    41     ///
    41     ///
    42     /// It can be used for checking the interface compatibility,
    42     /// It can be used for checking the interface compatibility,
    43     /// or it can serve as a skeleton of a new symmetric graph structure.
    43     /// or it can serve as a skeleton of a new symmetric graph structure.
    44     /// 
    44     /// 
    49     class StaticSymGraph
    49     class StaticSymGraph
    50     {
    50     {
    51     public:
    51     public:
    52       /// Defalult constructor.
    52       /// Defalult constructor.
    53 
    53 
    54       /// Defalult constructor.
    54       /// Default constructor.
    55       ///
    55       ///
    56       StaticSymGraph() { }
    56       StaticSymGraph() { }
    57       ///Copy consructor.
    57       ///Copy consructor.
    58 
    58 
    59 //       ///\todo It is not clear, what we expect from a copy constructor.
    59 //       ///\todo It is not clear, what we expect from a copy constructor.
   593     /// with additional functionality which enables to build a
   593     /// with additional functionality which enables to build a
   594     /// graph from scratch.
   594     /// graph from scratch.
   595     class ExtendableSymGraph : public StaticSymGraph
   595     class ExtendableSymGraph : public StaticSymGraph
   596     {
   596     {
   597     public:
   597     public:
   598       /// Defalult constructor.
   598       /// Default constructor.
   599 
   599 
   600       /// Defalult constructor.
   600       /// Default constructor.
   601       ///
   601       ///
   602       ExtendableSymGraph() { }
   602       ExtendableSymGraph() { }
   603       ///Add a new node to the graph.
   603       ///Add a new node to the graph.
   604 
   604 
   605       /// \return the new node.
   605       /// \return the new node.
   625     /// This class is an extension of \ref ExtendableGraph. It also makes it
   625     /// This class is an extension of \ref ExtendableGraph. It also makes it
   626     /// possible to erase edges or nodes.
   626     /// possible to erase edges or nodes.
   627     class ErasableSymGraph : public ExtendableSymGraph
   627     class ErasableSymGraph : public ExtendableSymGraph
   628     {
   628     {
   629     public:
   629     public:
   630       /// Defalult constructor.
   630       /// Default constructor.
   631 
   631 
   632       /// Defalult constructor.
   632       /// Default constructor.
   633       ///
   633       ///
   634       ErasableSymGraph() { }
   634       ErasableSymGraph() { }
   635       /// Deletes a node.
   635       /// Deletes a node.
   636 
   636 
   637       /// Deletes node \c n node.
   637       /// Deletes node \c n node.