RhodeCode

  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

    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.

          _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:

          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:

            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 {

          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> {

        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.

      ///

          _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

          _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 {

            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:

              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.

          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 _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;

          // 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  {

          } { // 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:

          } { // 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:

      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:

      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:

      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:

      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:

      ///

      /// 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:

      ///

      /// 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.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

          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

    {

          m.set(own_key, own_val);

          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 Value& val;

        const typename _WriteMap::Key& own_key;

        const typename _WriteMap::Value& own_val;

        _WriteMap& m;

      };

    };

    /// Read/writable map concept

    /// Read/writable map concept.

    ///

    template<typename K, typename T>

    class ReadWriteMap : public ReadMap<K,T>,

                         public WriteMap<K,T>

    {

    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;

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

      Value operator[](const Key &) const {

      }

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

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

      template<typename _ReadWriteMap>

      struct Constraints {

        void constraints() {

          checkConcept<ReadMap<K, T>, _ReadWriteMap >();

          checkConcept<WriteMap<K, T>, _ReadWriteMap >();

        }

      };

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

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

      typedef T Value;

      /// The reference type of the map.

      typedef R Reference;

      /// The const reference type of the map.

      typedef CR ConstReference;

    public:

      /// Returns a reference to the value associated with the given key.

      Reference operator[](const Key &) {

      }

      /// Returns a const reference to the value associated with the given key.

      ConstReference operator[](const Key &) const {

      }

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

      void set(const Key &k,const Value &t) { operator[](k)=t; }

      template<typename _ReferenceMap>

      struct Constraints {

        typename enable_if<typename _ReferenceMap::ReferenceMapTag, void>::type

        constraints() {

          checkConcept<ReadWriteMap<K, T>, _ReferenceMap >();

          ref = m[key];

          m[key] = val;

          m[key] = m[own_key];

          m[own_key] = m[key];

        }

        const Key& key;

        Value& val;

        Reference ref;

        ConstReference cref;

        const typename _ReferenceMap::Key& own_key;

        typename _ReferenceMap::Value& own_val;

        typename _ReferenceMap::Reference own_ref;

        typename _ReferenceMap::ConstReference own_cref;

        _ReferenceMap& m;

      };

    };

    // @}

  } //namespace concepts

} //namespace lemon

#endif

          ++i;

          typename _Digraph::Arc ed = i;

          e = (i == INVALID);

          e = (i != INVALID);

          ignore_unused_variable_warning(l);

          ignore_unused_variable_warning(e);

          ignore_unused_variable_warning(id);

          ignore_unused_variable_warning(ed);

        }

        _Path& p;

      };

      template <typename _Digraph, typename _Path>

      struct PathDumperConstraints<

        _Digraph, _Path,

        typename enable_if<typename _Path::RevPathTag, void>::type

      > {

        void constraints() {

          int l = p.length();

          int e = p.empty();

          typename _Path::RevArcIt id, i(p);

          ++i;

          typename _Digraph::Arc ed = i;

          e = (i == INVALID);

          e = (i != INVALID);

          ignore_unused_variable_warning(l);

          ignore_unused_variable_warning(e);

          ignore_unused_variable_warning(id);

          ignore_unused_variable_warning(ed);

        }

        _Path& p;

      };

    }

    /// \brief A skeleton structure for path dumpers.

    ///

    /// A skeleton structure for path dumpers. The path dumpers are

    /// the generalization of the paths. The path dumpers can

    /// enumerate the arcs of the path wheter in forward or in

    /// backward order.  In most time these classes are not used

    /// directly rather it used to assign a dumped class to a real

      void constraints() {

        Arc arc;

        Node node;

        visitor.start(node);

        visitor.stop(arc);

        visitor.reach(node);

        visitor.discover(arc);

        visitor.examine(arc);

        visitor.leave(node);

        visitor.backtrack(arc);

      }

      _Visitor& visitor;

    };

  };

#endif

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

  ///

  /// Default traits class of DfsVisit class.

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

  template<class GR>

  struct DfsVisitDefaultTraits {

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