RhodeCode

FIND_PACKAGE(Ghostscript)

FIND_PACKAGE(GLPK 4.33)

FIND_PACKAGE(CPLEX)

FIND_PACKAGE(COIN)

IF(DEFINED ENV{LEMON_CXX_WARNING})

  SET(CXX_WARNING $ENV{LEMON_CXX_WARNING})

ELSE()

  IF(CMAKE_COMPILER_IS_GNUCXX)

    SET(CXX_WARNING "-Wall -W -Wunused -Wformat=2 -Wctor-dtor-privacy -Wnon-virtual-dtor -Wno-char-subscripts -Wwrite-strings -Wno-char-subscripts -Wreturn-type -Wcast-qual -Wcast-align -Wsign-promo -Woverloaded-virtual -fno-strict-aliasing -Wold-style-cast -Wno-unknown-pragmas")

    SET(CMAKE_CXX_FLAGS_DEBUG CACHE STRING "-ggdb")

    SET(CMAKE_C_FLAGS_DEBUG CACHE STRING "-ggdb")

  ELSEIF(MSVC)

    # This part is unnecessary 'casue the same is set by the lemon/core.h.

    # Still keep it as an example.

    SET(CXX_WARNING "/wd4250 /wd4355 /wd4503 /wd4800 /wd4996")

    # Suppressed warnings:

    # C4250: 'class1' : inherits 'class2::member' via dominance

    # C4355: 'this' : used in base member initializer list

    # C4503: 'function' : decorated name length exceeded, name was truncated

    # C4800: 'type' : forcing value to bool 'true' or 'false'

    #        (performance warning)

    # C4996: 'function': was declared deprecated

  ELSE()

  ENDIF()

ENDIF()

SET(LEMON_CXX_WARNING_FLAGS ${CXX_WARNING} CACHE STRING "LEMON warning flags.")

SET(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} ${LEMON_CXX_WARNING_FLAGS}")

    "Flags used by the C++ compiler during maintainer builds."

    FORCE )

    "Flags used by the C compiler during maintainer builds."

    FORCE )

SET( CMAKE_EXE_LINKER_FLAGS_MAINTAINER

    "-Wl,--warn-unresolved-symbols,--warn-once" CACHE STRING

    "Flags used for linking binaries during maintainer builds."

    FORCE )

SET( CMAKE_SHARED_LINKER_FLAGS_MAINTAINER

    "-Wl,--warn-unresolved-symbols,--warn-once" CACHE STRING

    "Flags used by the shared libraries linker during maintainer builds."

    FORCE )

MARK_AS_ADVANCED(

    CMAKE_CXX_FLAGS_MAINTAINER

    CMAKE_C_FLAGS_MAINTAINER

    CMAKE_EXE_LINKER_FLAGS_MAINTAINER

    CMAKE_SHARED_LINKER_FLAGS_MAINTAINER )

IF(CMAKE_CONFIGURATION_TYPES)

  LIST(APPEND CMAKE_CONFIGURATION_TYPES Maintainer)

  LIST(REMOVE_DUPLICATES CMAKE_CONFIGURATION_TYPES)

  SET(CMAKE_CONFIGURATION_TYPES "${CMAKE_CONFIGURATION_TYPES}" CACHE STRING

      "Add the configurations that we need"

      FORCE)

 endif()

#else

  template <typename GR>

  struct BfsVisitor {

    typedef GR Digraph;

    typedef typename Digraph::Arc Arc;

    typedef typename Digraph::Node Node;

    void start(const Node&) {}

    void reach(const Node&) {}

    void process(const Node&) {}

    void discover(const Arc&) {}

    void examine(const Arc&) {}

    template <typename _Visitor>

    struct Constraints {

      void constraints() {

        Arc arc;

        Node node;

        visitor.start(node);

        visitor.reach(node);

        visitor.process(node);

        visitor.discover(arc);

        visitor.examine(arc);

      }

      _Visitor& visitor;

    };

  };

#endif

  /// \brief Default traits class of BfsVisit class.

  ///

  /// Default traits class of BfsVisit class.

  /// \tparam GR The type of the digraph the algorithm runs on.

  template<class GR>

  struct BfsVisitDefaultTraits {

    /// \brief The type of the digraph the algorithm runs on.

    typedef GR Digraph;

    /// \brief The type of the map that indicates which nodes are reached.

    ///

    /// The type of the map that indicates which nodes are reached.

    /// It must meet the \ref concepts::ReadWriteMap "ReadWriteMap" concept.

    typedef typename Digraph::template NodeMap<bool> ReachedMap;

    /// \brief Instantiates a ReachedMap.

    ///

    /// This function instantiates a ReachedMap.

    /// \param digraph is the digraph, to which

      ///

      /// \note This operator only have to define some strict ordering of

      /// the items; this order has nothing to do with the iteration

      /// ordering of the items.

      bool operator<(const GraphItem&) const { return false; }

      template<typename _GraphItem>

      struct Constraints {

        void constraints() {

          _GraphItem i1;

          i1=INVALID;

          _GraphItem i2 = i1;

          _GraphItem i3 = INVALID;

          i1 = i2 = i3;

          bool b;

          b = (ia == ib) && (ia != ib);

          b = (ia == INVALID) && (ib != INVALID);

          b = (ia < ib);

        }

        const _GraphItem &ia;

        const _GraphItem &ib;

      };

    };

    /// \brief Base skeleton class for directed graphs.

    ///

    /// This class describes the base interface of directed graph types.

    /// All digraph %concepts have to conform to this class.

    /// It just provides types for nodes and arcs and functions 

    /// to get the source and the target nodes of arcs.

    class BaseDigraphComponent {

    public:

      typedef BaseDigraphComponent Digraph;

      /// \brief Node class of the digraph.

      ///

      /// This class represents the nodes of the digraph.

      typedef GraphItem<'n'> Node;

      /// \brief Arc class of the digraph.

      ///

      /// This class represents the arcs of the digraph.

      typedef GraphItem<'a'> Arc;

      ///

      /// This function returns the opposite node on the given arc.

      Node oppositeNode(const Node&, const Arc&) const {

        return INVALID;

      }

      template <typename _Digraph>

      struct Constraints {

        typedef typename _Digraph::Node Node;

        typedef typename _Digraph::Arc Arc;

        void constraints() {

          checkConcept<GraphItem<'n'>, Node>();

          checkConcept<GraphItem<'a'>, Arc>();

          {

            Node n;

            Arc e(INVALID);

            n = digraph.source(e);

            n = digraph.target(e);

            n = digraph.oppositeNode(n, e);

          }

        }

        const _Digraph& digraph;

      };

    };

    /// \brief Base skeleton class for undirected graphs.

    ///

    /// This class describes the base interface of undirected graph types.

    /// All graph %concepts have to conform to this class.

    /// It extends the interface of \ref BaseDigraphComponent with an

    /// \c Edge type and functions to get the end nodes of edges,

    /// to convert from arcs to edges and to get both direction of edges.

    class BaseGraphComponent : public BaseDigraphComponent {

    public:

      typedef BaseGraphComponent Graph;

      typedef BaseDigraphComponent::Node Node;

      typedef BaseDigraphComponent::Arc Arc;

      /// \brief Undirected edge class of the graph.

      ///

      /// This class represents the undirected edges of the graph.

      /// Undirected graphs can be used as directed graphs, each edge is

      /// represented by two opposite directed arcs.

      class Edge : public GraphItem<'e'> {

        typedef typename _Graph::Node Node;

        typedef typename _Graph::Arc Arc;

        typedef typename _Graph::Edge Edge;

        void constraints() {

          checkConcept<BaseDigraphComponent, _Graph>();

          checkConcept<GraphItem<'e'>, Edge>();

          {

            Node n;

            Edge ue(INVALID);

            Arc e;

            n = graph.u(ue);

            n = graph.v(ue);

            e = graph.direct(ue, true);

            e = graph.direct(ue, false);

            e = graph.direct(ue, n);

            e = graph.oppositeArc(e);

            ue = e;

            bool d = graph.direction(e);

            ignore_unused_variable_warning(d);

          }

        }

        const _Graph& graph;

      };

    };

    /// \brief Skeleton class for \e idable directed graphs.

    ///

    /// This class describes the interface of \e idable directed graphs.

    /// It extends \ref BaseDigraphComponent with the core ID functions.

    /// The ids of the items must be unique and immutable.

    /// This concept is part of the Digraph concept.

    template <typename BAS = BaseDigraphComponent>

    class IDableDigraphComponent : public BAS {

    public:

      typedef BAS Base;

      typedef typename Base::Node Node;

      typedef typename Base::Arc Arc;

      /// \brief Return a unique integer id for the given node.

      ///

      /// This function returns a unique integer id for the given node.

      int id(const Node&) const { return -1; }

      /// \brief Return the node by its unique id.

      template <typename _Digraph>

      struct Constraints {

        void constraints() {

          checkConcept<Base, _Digraph >();

          typename _Digraph::Node node;

          node=INVALID;

          int nid = digraph.id(node);

          nid = digraph.id(node);

          node = digraph.nodeFromId(nid);

          typename _Digraph::Arc arc;

          arc=INVALID;

          int eid = digraph.id(arc);

          eid = digraph.id(arc);

          arc = digraph.arcFromId(eid);

          nid = digraph.maxNodeId();

          ignore_unused_variable_warning(nid);

          eid = digraph.maxArcId();

          ignore_unused_variable_warning(eid);

        }

        const _Digraph& digraph;

      };

    };

    /// \brief Skeleton class for \e idable undirected graphs.

    ///

    /// This class describes the interface of \e idable undirected

    /// graphs. It extends \ref IDableDigraphComponent with the core ID

    /// functions of undirected graphs.

    /// The ids of the items must be unique and immutable.

    /// This concept is part of the Graph concept.

    template <typename BAS = BaseGraphComponent>

    class IDableGraphComponent : public IDableDigraphComponent<BAS> {

    public:

      typedef BAS Base;

      typedef typename Base::Edge Edge;

      using IDableDigraphComponent<Base>::id;

      /// \brief Return a unique integer id for the given edge.

      ///

      /// This function returns a unique integer id for the given edge.

      int id(const Edge&) const { return -1; }

      /// then the result of the function is undefined.

      Edge edgeFromId(int) const { return INVALID; }

      /// \brief Return an integer greater or equal to the maximum

      /// edge id.

      ///

      /// This function returns an integer greater or equal to the

      /// maximum edge id.

      int maxEdgeId() const { return -1; }

      template <typename _Graph>

      struct Constraints {

        void constraints() {

          checkConcept<IDableDigraphComponent<Base>, _Graph >();

          typename _Graph::Edge edge;

          int ueid = graph.id(edge);

          ueid = graph.id(edge);

          edge = graph.edgeFromId(ueid);

          ueid = graph.maxEdgeId();

          ignore_unused_variable_warning(ueid);

        }

        const _Graph& graph;

      };

    };

    /// \brief Concept class for \c NodeIt, \c ArcIt and \c EdgeIt types.

    ///

    /// This class describes the concept of \c NodeIt, \c ArcIt and 

    /// \c EdgeIt subtypes of digraph and graph types.

    template <typename GR, typename Item>

    class GraphItemIt : public Item {

    public:

      /// \brief Default constructor.

      ///

      /// Default constructor.

      /// \warning The default constructor is not required to set

      /// the iterator to some well-defined value. So you should consider it

      /// as uninitialized.

      GraphItemIt() {}

      /// \brief Copy constructor.

      ///

      /// Copy constructor.

      GraphItemIt(const GraphItemIt& it) : Item(it) {}

      /// \brief Constructor that sets the iterator to the first item.

      /// \brief Inequality operator

      ///

      /// Inequality operator.

      /// Two iterators are equal if and only if they point to the

      /// same object or both are invalid.

      bool operator!=(const GraphItemIt&) const { return true;}

      template<typename _GraphItemIt>

      struct Constraints {

        void constraints() {

          checkConcept<GraphItem<>, _GraphItemIt>();

          _GraphItemIt it1(g);

          _GraphItemIt it2;

          _GraphItemIt it3 = it1;

          _GraphItemIt it4 = INVALID;

          it2 = ++it1;

          ++it2 = it1;

          ++(++it1);

          Item bi = it1;

          bi = it2;

        }

        const GR& g;

      };

    };

    /// \brief Concept class for \c InArcIt, \c OutArcIt and 

    /// \c IncEdgeIt types.

    ///

    /// This class describes the concept of \c InArcIt, \c OutArcIt 

    /// and \c IncEdgeIt subtypes of digraph and graph types.

    ///

    /// \note Since these iterator classes do not inherit from the same

    /// base class, there is an additional template parameter (selector)

    /// \c sel. For \c InArcIt you should instantiate it with character 

    /// \c 'i', for \c OutArcIt with \c 'o' and for \c IncEdgeIt with \c 'e'.

    template <typename GR,

              typename Item = typename GR::Arc,

              typename Base = typename GR::Node,

              char sel = '0'>

    class GraphIncIt : public Item {

    public:

      /// \brief Default constructor.

      ///

      /// Default constructor.

      /// \warning The default constructor is not required to set

      /// the iterator to some well-defined value. So you should consider it

      /// \brief Inequality operator

      ///

      /// Inequality operator.

      /// Two iterators are equal if and only if they point to the

      /// same object or both are invalid.

      bool operator!=(const GraphIncIt&) const { return true;}

      template <typename _GraphIncIt>

      struct Constraints {

        void constraints() {

          checkConcept<GraphItem<sel>, _GraphIncIt>();

          _GraphIncIt it1(graph, node);

          _GraphIncIt it2;

          _GraphIncIt it3 = it1;

          _GraphIncIt it4 = INVALID;

          it2 = ++it1;

          ++it2 = it1;

          ++(++it1);

          Item e = it1;

          e = it2;

        }

        const Base& node;

        const GR& graph;

      };

    };

    /// \brief Skeleton class for iterable directed graphs.

    ///

    /// This class describes the interface of iterable directed

    /// graphs. It extends \ref BaseDigraphComponent with the core

    /// iterable interface.

    /// This concept is part of the Digraph concept.

    template <typename BAS = BaseDigraphComponent>

    class IterableDigraphComponent : public BAS {

    public:

      typedef BAS Base;

      typedef typename Base::Node Node;

      typedef typename Base::Arc Arc;

      typedef IterableDigraphComponent Digraph;

      /// \name Base Iteration

      ///

      /// This interface provides functions for iteration on digraph items.

      ///

          }

          {

            checkConcept<GraphItemIt<_Digraph, typename _Digraph::Arc>,

              typename _Digraph::ArcIt >();

            checkConcept<GraphItemIt<_Digraph, typename _Digraph::Node>,

              typename _Digraph::NodeIt >();

            checkConcept<GraphIncIt<_Digraph, typename _Digraph::Arc,

              typename _Digraph::Node, 'i'>, typename _Digraph::InArcIt>();

            checkConcept<GraphIncIt<_Digraph, typename _Digraph::Arc,

              typename _Digraph::Node, 'o'>, typename _Digraph::OutArcIt>();

            typename _Digraph::Node n;

            const typename _Digraph::InArcIt iait(INVALID);

            const typename _Digraph::OutArcIt oait(INVALID);

            n = digraph.baseNode(iait);

            n = digraph.runningNode(iait);

            n = digraph.baseNode(oait);

            n = digraph.runningNode(oait);

            ignore_unused_variable_warning(n);

          }

        }

        const _Digraph& digraph;

      };

    };

    /// \brief Skeleton class for iterable undirected graphs.

    ///

    /// This class describes the interface of iterable undirected

    /// graphs. It extends \ref IterableDigraphComponent with the core

    /// iterable interface of undirected graphs.

    /// This concept is part of the Graph concept.

    template <typename BAS = BaseGraphComponent>

    class IterableGraphComponent : public IterableDigraphComponent<BAS> {

    public:

      typedef BAS Base;

      typedef typename Base::Node Node;

      typedef typename Base::Arc Arc;

      typedef typename Base::Edge Edge;

      typedef IterableGraphComponent Graph;

      /// \name Base Iteration

      ///

      /// This interface provides functions for iteration on edges.

              graph.first(edge);

              graph.next(edge);

            }

            {

              graph.firstInc(edge, dir, node);

              graph.nextInc(edge, dir);

            }

          }

          {

            checkConcept<GraphItemIt<_Graph, typename _Graph::Edge>,

              typename _Graph::EdgeIt >();

            checkConcept<GraphIncIt<_Graph, typename _Graph::Edge,

              typename _Graph::Node, 'e'>, typename _Graph::IncEdgeIt>();

            typename _Graph::Node n;

            const typename _Graph::IncEdgeIt ieit(INVALID);

            n = graph.baseNode(ieit);

            n = graph.runningNode(ieit);

          }

        }

        const _Graph& graph;

      };

    };

    /// \brief Skeleton class for alterable directed graphs.

    ///

    /// This class describes the interface of alterable directed

    /// graphs. It extends \ref BaseDigraphComponent with the alteration

    /// notifier interface. It implements

    /// an observer-notifier pattern for each digraph item. More

    /// obsevers can be registered into the notifier and whenever an

    /// alteration occured in the digraph all the observers will be

    /// notified about it.

    template <typename BAS = BaseDigraphComponent>

    class AlterableDigraphComponent : public BAS {

    public:

      typedef BAS Base;

      typedef typename Base::Node Node;

      typedef typename Base::Arc Arc;

      /// Node alteration notifier class.

      typedef AlterationNotifier<AlterableDigraphComponent, Node>

      NodeNotifier;

      }

      /// \brief Return the arc alteration notifier.

      ///

      /// This function gives back the arc alteration notifier.

      ArcNotifier& notifier(Arc) const {

        return ArcNotifier();

      }

      template <typename _Digraph>

      struct Constraints {

        void constraints() {

          checkConcept<Base, _Digraph>();

          typename _Digraph::NodeNotifier& nn

            = digraph.notifier(typename _Digraph::Node());

          typename _Digraph::ArcNotifier& en

            = digraph.notifier(typename _Digraph::Arc());

          ignore_unused_variable_warning(nn);

          ignore_unused_variable_warning(en);

        }

        const _Digraph& digraph;

      };

    };

    /// \brief Skeleton class for alterable undirected graphs.

    ///

    /// This class describes the interface of alterable undirected

    /// graphs. It extends \ref AlterableDigraphComponent with the alteration

    /// notifier interface of undirected graphs. It implements

    /// an observer-notifier pattern for the edges. More

    /// obsevers can be registered into the notifier and whenever an

    /// alteration occured in the graph all the observers will be

    /// notified about it.

    template <typename BAS = BaseGraphComponent>

    class AlterableGraphComponent : public AlterableDigraphComponent<BAS> {

    public:

      typedef BAS Base;

      typedef typename Base::Edge Edge;

      /// Edge alteration notifier class.

      typedef AlterationNotifier<AlterableGraphComponent, Edge>

      EdgeNotifier;

      /// \brief Return the edge alteration notifier.

      ///

      /// This function gives back the edge alteration notifier.

      EdgeNotifier& notifier(Edge) const {

        return EdgeNotifier();

      }

      template <typename _Graph>

      struct Constraints {

        void constraints() {

          checkConcept<AlterableDigraphComponent<Base>, _Graph>();

          typename _Graph::EdgeNotifier& uen

            = graph.notifier(typename _Graph::Edge());

          ignore_unused_variable_warning(uen);

        }

        const _Graph& graph;

      };

    };

    /// \brief Concept class for standard graph maps.

    ///

    /// This class describes the concept of standard graph maps, i.e.

    /// the \c NodeMap, \c ArcMap and \c EdgeMap subtypes of digraph and 

    /// graph types, which can be used for associating data to graph items.

    /// The standard graph maps must conform to the ReferenceMap concept.

    template <typename GR, typename K, typename V>

    class GraphMap : public ReferenceMap<K, V, V&, const V&> {

      typedef ReferenceMap<K, V, V&, const V&> Parent;

    public:

      /// The key type of the map.

      typedef K Key;

      /// The value type of the map.

      typedef V Value;

      /// The reference type of the map.

      typedef Value& Reference;

      /// The const reference type of the map.

      typedef const Value& ConstReference;

    public:

      template<typename _Map>

      struct Constraints {

        void constraints() {

          checkConcept

            <ReferenceMap<Key, Value, Value&, const Value&>, _Map>();

          _Map m1(g);

          _Map m2(g,t);

          // Copy constructor

          // _Map m3(m);

          // Assignment operator

          // ReadMap<Key, Value> cmap;

          // m3 = cmap;

          ignore_unused_variable_warning(m1);

          ignore_unused_variable_warning(m2);

          // ignore_unused_variable_warning(m3);

        }

        const _Map &m;

        const GR &g;

        const typename GraphMap::Value &t;

      };

    };

    /// \brief Skeleton class for mappable directed graphs.

    ///

    /// This class describes the interface of mappable directed graphs.

    /// It extends \ref BaseDigraphComponent with the standard digraph 

    /// map classes, namely \c NodeMap and \c ArcMap.

    /// This concept is part of the Digraph concept.

    template <typename BAS = BaseDigraphComponent>

    class MappableDigraphComponent : public BAS  {

    public:

      typedef BAS Base;

      typedef typename Base::Node Node;

      typedef typename Base::Arc Arc;

      typedef MappableDigraphComponent Digraph;

      /// \brief Standard graph map for the nodes.

      ///

      /// Standard graph map for the nodes.

      /// It conforms to the ReferenceMap concept.

            checkConcept<GraphMap<_Digraph, typename _Digraph::Node, bool>,

              BoolNodeMap >();

          } { // Dummy map test

            typedef typename _Digraph::template NodeMap<Dummy> DummyNodeMap;

            checkConcept<GraphMap<_Digraph, typename _Digraph::Node, Dummy>,

              DummyNodeMap >();

          }

          { // int map test

            typedef typename _Digraph::template ArcMap<int> IntArcMap;

            checkConcept<GraphMap<_Digraph, typename _Digraph::Arc, int>,

              IntArcMap >();

          } { // bool map test

            typedef typename _Digraph::template ArcMap<bool> BoolArcMap;

            checkConcept<GraphMap<_Digraph, typename _Digraph::Arc, bool>,

              BoolArcMap >();

          } { // Dummy map test

            typedef typename _Digraph::template ArcMap<Dummy> DummyArcMap;

            checkConcept<GraphMap<_Digraph, typename _Digraph::Arc, Dummy>,

              DummyArcMap >();

          }

        }

        const _Digraph& digraph;

      };

    };

    /// \brief Skeleton class for mappable undirected graphs.

    ///

    /// This class describes the interface of mappable undirected graphs.

    /// It extends \ref MappableDigraphComponent with the standard graph 

    /// map class for edges (\c EdgeMap).

    /// This concept is part of the Graph concept.

    template <typename BAS = BaseGraphComponent>

    class MappableGraphComponent : public MappableDigraphComponent<BAS>  {

    public:

      typedef BAS Base;

      typedef typename Base::Edge Edge;

      typedef MappableGraphComponent Graph;

      /// \brief Standard graph map for the edges.

      ///

      /// Standard graph map for the edges.

      /// It conforms to the ReferenceMap concept.

      template <typename V>

      class EdgeMap : public GraphMap<MappableGraphComponent, Edge, V> {

          int value;

          Dummy() : value(0) {}

          Dummy(int _v) : value(_v) {}

        };

        void constraints() {

          checkConcept<MappableDigraphComponent<Base>, _Graph>();

          { // int map test

            typedef typename _Graph::template EdgeMap<int> IntEdgeMap;

            checkConcept<GraphMap<_Graph, typename _Graph::Edge, int>,

              IntEdgeMap >();

          } { // bool map test

            typedef typename _Graph::template EdgeMap<bool> BoolEdgeMap;

            checkConcept<GraphMap<_Graph, typename _Graph::Edge, bool>,

              BoolEdgeMap >();

          } { // Dummy map test

            typedef typename _Graph::template EdgeMap<Dummy> DummyEdgeMap;

            checkConcept<GraphMap<_Graph, typename _Graph::Edge, Dummy>,

              DummyEdgeMap >();

          }

        }

        const _Graph& graph;

      };

    };

    /// \brief Skeleton class for extendable directed graphs.

    ///

    /// This class describes the interface of extendable directed graphs.

    /// It extends \ref BaseDigraphComponent with functions for adding 

    /// nodes and arcs to the digraph.

    /// This concept requires \ref AlterableDigraphComponent.

    template <typename BAS = BaseDigraphComponent>

    class ExtendableDigraphComponent : public BAS {

    public:

      typedef BAS Base;

      typedef typename Base::Node Node;

      typedef typename Base::Arc Arc;

      /// \brief Add a new node to the digraph.

      ///

      /// This function adds a new node to the digraph.

      Node addNode() {

        return INVALID;

      }

      /// \brief Add a new arc connecting the given two nodes.

      ///

      /// This function adds a new arc connecting the given two nodes

      /// of the digraph.

      Arc addArc(const Node&, const Node&) {

        return INVALID;

      }

      template <typename _Digraph>

      struct Constraints {

        void constraints() {

          checkConcept<Base, _Digraph>();

          typename _Digraph::Node node_a, node_b;

          node_a = digraph.addNode();

          node_b = digraph.addNode();

          typename _Digraph::Arc arc;

          arc = digraph.addArc(node_a, node_b);

        }

        _Digraph& digraph;

      };

    };

    /// \brief Skeleton class for extendable undirected graphs.

    ///

    /// This class describes the interface of extendable undirected graphs.

    /// It extends \ref BaseGraphComponent with functions for adding 

    /// nodes and edges to the graph.

    /// This concept requires \ref AlterableGraphComponent.

    template <typename BAS = BaseGraphComponent>

    class ExtendableGraphComponent : public BAS {

    public:

      typedef BAS Base;

      typedef typename Base::Node Node;

      typedef typename Base::Edge Edge;

      /// \brief Add a new node to the digraph.

      ///

      /// This function adds a new node to the digraph.

      Node addNode() {

        return INVALID;

      }

      /// \brief Add a new edge connecting the given two nodes.

      ///

      /// This function adds a new edge connecting the given two nodes

      /// of the graph.

      Edge addEdge(const Node&, const Node&) {

        return INVALID;

      }

      template <typename _Graph>

      struct Constraints {

        void constraints() {

          checkConcept<Base, _Graph>();

          typename _Graph::Node node_a, node_b;

          node_a = graph.addNode();

          node_b = graph.addNode();

          typename _Graph::Edge edge;

          edge = graph.addEdge(node_a, node_b);

        }

        _Graph& graph;

      };

    };

    /// \brief Skeleton class for erasable directed graphs.

    ///

    /// This class describes the interface of erasable directed graphs.

    /// It extends \ref BaseDigraphComponent with functions for removing 

    /// nodes and arcs from the digraph.

    /// This concept requires \ref AlterableDigraphComponent.

    template <typename BAS = BaseDigraphComponent>

    class ErasableDigraphComponent : public BAS {

    public:

      typedef BAS Base;

      typedef typename Base::Node Node;

      typedef typename Base::Arc Arc;

      /// \brief Erase a node from the digraph.

      ///

      /// This function erases the given node from the digraph and all arcs 

      /// connected to the node.

      void erase(const Node&) {}

      /// \brief Erase an arc from the digraph.

      ///

      /// This function erases the given arc from the digraph.

      void erase(const Arc&) {}

      template <typename _Digraph>

      struct Constraints {

        void constraints() {

          checkConcept<Base, _Digraph>();

          const typename _Digraph::Node node(INVALID);

          digraph.erase(node);

          const typename _Digraph::Arc arc(INVALID);

          digraph.erase(arc);

        }

        _Digraph& digraph;

      };

    };

    /// \brief Skeleton class for erasable undirected graphs.

    ///

    /// This class describes the interface of erasable undirected graphs.

    /// It extends \ref BaseGraphComponent with functions for removing 

    /// nodes and edges from the graph.

    /// This concept requires \ref AlterableGraphComponent.

    template <typename BAS = BaseGraphComponent>

    class ErasableGraphComponent : public BAS {

    public:

      typedef BAS Base;

      typedef typename Base::Node Node;

      typedef typename Base::Edge Edge;

      /// \brief Erase a node from the graph.

      ///

      /// This function erases the given node from the graph and all edges

      /// connected to the node.

      void erase(const Node&) {}

      /// \brief Erase an edge from the digraph.

      ///

      /// This function erases the given edge from the digraph.

      void erase(const Edge&) {}

      template <typename _Graph>

      struct Constraints {

        void constraints() {

          checkConcept<Base, _Graph>();

          const typename _Graph::Node node(INVALID);

          graph.erase(node);

          const typename _Graph::Edge edge(INVALID);

          graph.erase(edge);

        }

        _Graph& graph;

      };

    };

    /// \brief Skeleton class for clearable directed graphs.

    ///

    /// This class describes the interface of clearable directed graphs.

    /// It extends \ref BaseDigraphComponent with a function for clearing

    /// the digraph.

    /// This concept requires \ref AlterableDigraphComponent.

    template <typename BAS = BaseDigraphComponent>

    class ClearableDigraphComponent : public BAS {

    public:

      typedef BAS Base;

      /// \brief Erase all nodes and arcs from the digraph.

      ///

      /// This function erases all nodes and arcs from the digraph.

      void clear() {}

      template <typename _Digraph>

      struct Constraints {

        void constraints() {

          checkConcept<Base, _Digraph>();

          digraph.clear();

        }

        _Digraph& digraph;

      };

    };

    /// \brief Skeleton class for clearable undirected graphs.

    ///

    /// This class describes the interface of clearable undirected graphs.

    /// It extends \ref BaseGraphComponent with a function for clearing

    /// the graph.

    /// This concept requires \ref AlterableGraphComponent.

    template <typename BAS = BaseGraphComponent>

    class ClearableGraphComponent : public ClearableDigraphComponent<BAS> {

    public:

      typedef BAS Base;

      /// \brief Erase all nodes and edges from the graph.

      ///

      /// This function erases all nodes and edges from the graph.

      void clear() {}

      template <typename _Graph>

      struct Constraints {

        void constraints() {

          checkConcept<Base, _Graph>();

          graph.clear();

        }

        _Graph& graph;

      };

    };

  }

}

#endif

          heap.push(own_item, own_prio);

          heap.pop();

          heap.set(item, prio);

          heap.decrease(item, prio);

          heap.increase(item, prio);

          heap.set(own_item, own_prio);

          heap.decrease(own_item, own_prio);

          heap.increase(own_item, own_prio);

          heap.erase(item);

          heap.erase(own_item);

          heap.clear();

          own_state = heap.state(own_item);

          heap.state(own_item, own_state);

          own_state = _Heap::PRE_HEAP;

          own_state = _Heap::IN_HEAP;

          own_state = _Heap::POST_HEAP;

        }

        _Heap& heap;

        ItemIntMap& map;

      };

    };

    /// @}

  } // namespace lemon

}

#endif

      /// (The type of objects associated with the keys).

      typedef T Value;

      /// Returns the value associated with the given key.

      Value operator[](const Key &) const {

        return *static_cast<Value *>(0);

      }

      template<typename _ReadMap>

      struct Constraints {

        void constraints() {

          Value val = m[key];

          val = m[key];

          typename _ReadMap::Value own_val = m[own_key];

          own_val = m[own_key];

          ignore_unused_variable_warning(key);

          ignore_unused_variable_warning(val);

          ignore_unused_variable_warning(own_key);

          ignore_unused_variable_warning(own_val);

        }

        const Key& key;

        const typename _ReadMap::Key& own_key;

        const _ReadMap& m;

      };

    };

    /// Writable map concept

    /// Writable map concept.

    ///

    template<typename K, typename T>

    class WriteMap

    {

    public:

      /// The key type of the map.

      typedef K Key;

      /// \brief The value type of the map.

      /// (The type of objects associated with the keys).

      typedef T Value;

      /// Sets the value associated with the given key.

      void set(const Key &, const Value &) {}

      /// Default constructor.