COIN-OR::LEMON - Graph Library

Changeset 1909:2d806130e700 in lemon-0.x for lemon/full_graph.h


Ignore:
Timestamp:
01/26/06 16:42:13 (14 years ago)
Author:
Mihaly Barasz
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2484
Message:

Undir -> U transition

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/full_graph.h

    r1875 r1909  
    3232///\ingroup graphs
    3333///\file
    34 ///\brief FullGraph and UndirFullGraph classes.
     34///\brief FullGraph and FullUGraph classes.
    3535
    3636
     
    214214
    215215
    216   class UndirFullGraphBase {
     216  class FullUGraphBase {
    217217    int _nodeNum;
    218218    int _edgeNum;
    219219  public:
    220220
    221     typedef UndirFullGraphBase Graph;
     221    typedef FullUGraphBase Graph;
    222222
    223223    class Node;
     
    226226  public:
    227227
    228     UndirFullGraphBase() {}
     228    FullUGraphBase() {}
    229229
    230230
     
    302302     
    303303    class Node {
    304       friend class UndirFullGraphBase;
     304      friend class FullUGraphBase;
    305305
    306306    protected:
     
    318318
    319319    class Edge {
    320       friend class UndirFullGraphBase;
     320      friend class FullUGraphBase;
    321321     
    322322    protected:
     
    378378  };
    379379
    380   typedef StaticMappableUndirGraphExtender<
    381     IterableUndirGraphExtender<
    382     AlterableUndirGraphExtender<
    383     UndirGraphExtender<UndirFullGraphBase> > > > ExtendedUndirFullGraphBase;
     380  typedef StaticMappableUGraphExtender<
     381    IterableUGraphExtender<
     382    AlterableUGraphExtender<
     383    UGraphExtender<FullUGraphBase> > > > ExtendedFullUGraphBase;
    384384
    385385  /// \ingroup graphs
     
    391391  /// edges or nodes.
    392392  ///
    393   /// The main difference beetween the \e FullGraph and \e UndirFullGraph class
     393  /// The main difference beetween the \e FullGraph and \e FullUGraph class
    394394  /// is that this class conforms to the undirected graph concept and
    395395  /// it does not contain the loop edges.
     
    398398  ///
    399399  /// \author Balazs Dezso
    400   class UndirFullGraph : public ExtendedUndirFullGraphBase {
    401   public:
    402     UndirFullGraph(int n) { construct(n); }
     400  class FullUGraph : public ExtendedFullUGraphBase {
     401  public:
     402    FullUGraph(int n) { construct(n); }
    403403  };
    404404
    405405
    406   class FullUndirBipartiteGraphBase {
     406  class FullUBipartiteGraphBase {
    407407  protected:
    408408
     
    416416    class NodeSetError : public LogicError {
    417417      virtual const char* exceptionName() const {
    418         return "lemon::FullUndirBipartiteGraph::NodeSetError";
     418        return "lemon::FullUBipartiteGraph::NodeSetError";
    419419      }
    420420    };
    421421 
    422422    class Node {
    423       friend class FullUndirBipartiteGraphBase;
     423      friend class FullUBipartiteGraphBase;
    424424    protected:
    425425      int id;
     
    435435
    436436    class Edge {
    437       friend class FullUndirBipartiteGraphBase;
     437      friend class FullUBipartiteGraphBase;
    438438    protected:
    439439      int id;
     
    576576
    577577
    578   typedef StaticMappableUndirBipartiteGraphExtender<
    579     IterableUndirBipartiteGraphExtender<
    580     AlterableUndirBipartiteGraphExtender<
    581     UndirBipartiteGraphExtender <
    582     FullUndirBipartiteGraphBase> > > >
    583   ExtendedFullUndirBipartiteGraphBase;
    584 
    585 
    586   class FullUndirBipartiteGraph :
    587     public ExtendedFullUndirBipartiteGraphBase {
    588   public:
    589     typedef ExtendedFullUndirBipartiteGraphBase Parent;
    590     FullUndirBipartiteGraph(int upperNodeNum, int lowerNodeNum) {
     578  typedef StaticMappableUBipartiteGraphExtender<
     579    IterableUBipartiteGraphExtender<
     580    AlterableUBipartiteGraphExtender<
     581    UBipartiteGraphExtender <
     582    FullUBipartiteGraphBase> > > >
     583  ExtendedFullUBipartiteGraphBase;
     584
     585
     586  class FullUBipartiteGraph :
     587    public ExtendedFullUBipartiteGraphBase {
     588  public:
     589    typedef ExtendedFullUBipartiteGraphBase Parent;
     590    FullUBipartiteGraph(int upperNodeNum, int lowerNodeNum) {
    591591      Parent::construct(upperNodeNum, lowerNodeNum);
    592592    }
Note: See TracChangeset for help on using the changeset viewer.