/* -*- C++ -*-

 * src/lemon/merge_node_graph_wrapper.h - Part of LEMON, a generic C++ optimization library

 *

 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Combinatorial Optimization Research Group, EGRES).

 *

 * Permission to use, modify and distribute this software is granted

 * provided that this copyright notice appears in all copies. For

 * precise terms see the accompanying LICENSE file.

 *

 * This software is provided "AS IS" with no warranty of any kind,

 * express or implied, and with no claim as to its suitability for any

 * purpose.

 *

 */

#ifndef LEMON_MERGE_NODE_GRAPH_WRAPPER_H

#define LEMON_MERGE_NODE_GRAPH_WRAPPER_H

#include <lemon/invalid.h>

#include <lemon/maps.h>

#include <lemon/map_defines.h>

#include <lemon/graph_wrapper.h>

#include <iostream>

using std::cout;

using std::endl;

#include <boost/type_traits.hpp>

#include <boost/utility/enable_if.hpp>

namespace lemon {

  template <class _Graph1>

  class P1 : public GraphWrapperBase<_Graph1> {

  };

  template <class _Graph2>

  class P2 : public GraphWrapperBase<_Graph2> {

  };

  /*! A base class for merging the node-set of two node-disjoint graphs 

    into the node-set of one graph.

   */

  template <typename _Graph1, typename _Graph2, typename Enable=void>

  class MergeNodeGraphWrapperBase : 

    public P1<_Graph1>, public P2<_Graph2> {

  public:

    void printNode() const { std::cout << "generic" << std::endl; }

    typedef _Graph1 Graph1;

    typedef _Graph2 Graph2;

    typedef P1<_Graph1> Parent1;

    typedef P2<_Graph2> Parent2;

    typedef typename Parent1::Node Graph1Node;

    typedef typename Parent2::Node Graph2Node;

  protected:

    MergeNodeGraphWrapperBase() { }

  public:

    template <typename _Value> class NodeMap;

    class Node : public Graph1Node, public Graph2Node {

      friend class MergeNodeGraphWrapperBase<_Graph1, _Graph2>;

      template <typename Value> friend class NodeMap;

    protected:

      bool backward; //true, iff backward

    public:

      Node() { }

      /// \todo =false is needed, or causes problems?

      /// If \c _backward is false, then we get an edge corresponding to the 

      /// original one, otherwise its oppositely directed pair is obtained.

      Node(const Graph1Node& n1, 

	   const Graph2Node& n2, bool _backward) : 

	Graph1Node(n1), Graph2Node(n2), backward(_backward) { }

      Node(Invalid i) : Graph1Node(i), Graph2Node(i), backward(true) { }

      bool operator==(const Node& v) const { 

	return (this->backward==v.backward && 

		static_cast<Graph1Node>(*this)==

		static_cast<Graph1Node>(v) && 

		static_cast<Graph2Node>(*this)==

		static_cast<Graph2Node>(v));

      } 

      bool operator!=(const Node& v) const { 

	return (this->backward!=v.backward || 

		static_cast<Graph1Node>(*this)!=

		static_cast<Graph1Node>(v) || 

		static_cast<Graph2Node>(*this)!=

		static_cast<Graph2Node>(v));

      }

    };

    //typedef void Edge;

    class Edge { };

    void first(Node& i) const {

      Parent1::graph->first(*static_cast<Graph1Node*>(&i));

      i.backward=false;

      if (*static_cast<Graph1Node*>(&i)==INVALID) {

	Parent2::graph->first(*static_cast<Graph2Node*>(&i));

	i.backward=true;

      }

    }

    void next(Node& i) const {

      if (!(i.backward)) {

	Parent1::graph->next(*static_cast<Graph1Node*>(&i));

	if (*static_cast<Graph1Node*>(&i)==INVALID) {

	  Parent2::graph->first(*static_cast<Graph2Node*>(&i));

	  i.backward=true;

	}

      } else {

	Parent2::graph->next(*static_cast<Graph2Node*>(&i));

      }

    }

    int id(const Node& n) const { 

      if (!n.backward) 

	return this->Parent1::graph->id(n);

      else

	return this->Parent2::graph->id(n);

    }

    template <typename _Value> 

    class NodeMap : public Parent1::template NodeMap<_Value>, 

		    public Parent2::template NodeMap<_Value> { 

      typedef typename Parent1::template NodeMap<_Value> ParentMap1;

      typedef typename Parent2::template NodeMap<_Value> ParentMap2;

    public:

      typedef _Value Value;

      typedef Node Key;

      NodeMap(const MergeNodeGraphWrapperBase<_Graph1, _Graph2>& gw) : 

	ParentMap1(gw), ParentMap2(gw) { }

      NodeMap(const MergeNodeGraphWrapperBase<_Graph1, _Graph2>& gw, 

	      const _Value& value) : 

	ParentMap1(gw, value), ParentMap2(gw, value) { }

      _Value operator[](const Node& n) const {

	if (!n.backward) 

	  return ParentMap1::operator[](n);

	else 

	  return ParentMap2::operator[](n);

      }

      void set(const Node& n, const _Value& value) {

	if (!n.backward) 

	  ParentMap1::set(n, value);

	else 

	  ParentMap2::set(n, value);

      }

//       using ParentMap1::operator[];

//       using ParentMap2::operator[];

    };

  };

  //not yet working

  template <typename _Graph1, typename _Graph2>

  class MergeNodeGraphWrapperBase<

    _Graph1, _Graph2, typename boost::enable_if<

    boost::is_same<typename _Graph1::Node, typename _Graph2::Node> >::type> : 

    public P1<_Graph1>, public P2<_Graph2> {

  public :

    void printNode() const { std::cout << "same" << std::endl; }

    typedef _Graph1 Graph1;

    typedef _Graph2 Graph2;

    typedef P1<_Graph1> Parent1;

    typedef P2<_Graph2> Parent2;

    typedef typename Parent1::Node Graph1Node;

    typedef typename Parent2::Node Graph2Node;

  protected:

    MergeNodeGraphWrapperBase() { }

  public:

    class Node { };

    class Edge { };

    void first() const;

    void next() const;

  };

  //not yet working

  template <typename _Graph1, typename _Graph2>

  class MergeNodeGraphWrapperBase<

    _Graph1, _Graph2, typename boost::enable_if<

    boost::is_base_and_derived<typename _Graph1::Node, typename _Graph2::Node> >::type> : 

    public P1<_Graph1>, public P2<_Graph2> {

  public :

    void printNode() const { std::cout << "2. nagyobb" << std::endl; }

    typedef _Graph1 Graph1;

    typedef _Graph2 Graph2;

    typedef P1<_Graph1> Parent1;

    typedef P2<_Graph2> Parent2;

    typedef typename Parent1::Node Graph1Node;

    typedef typename Parent2::Node Graph2Node;

  protected:

    MergeNodeGraphWrapperBase() { }

  public:

    class Node { };

    class Edge { };

    void first() const;

    void next() const;

  };

  //not yet working

  template <typename _Graph1, typename _Graph2>

  class MergeNodeGraphWrapperBase<

    _Graph1, _Graph2, typename boost::enable_if<

    boost::is_base_and_derived<typename _Graph2::Node, typename _Graph1::Node> >::type> : 

    public P1<_Graph1>, public P2<_Graph2> {

  public :

    void printNode() const { std::cout << "1. nagyobb" << std::endl; }

    typedef _Graph1 Graph1;

    typedef _Graph2 Graph2;

    typedef P1<_Graph1> Parent1;

    typedef P2<_Graph2> Parent2;

    typedef typename Parent1::Node Graph1Node;

    typedef typename Parent2::Node Graph2Node;

  protected:

    MergeNodeGraphWrapperBase() { }

  public:

    class Node { };

    class Edge { };

    void first() const;

    void next() const;

  };

  template <typename _Graph1, typename _Graph2>

  class MergeNodeGraphWrapper : public 

  IterableGraphExtender<MergeNodeGraphWrapperBase<_Graph1, _Graph2> > {

  public:

    typedef _Graph1 Graph1;

    typedef _Graph2 Graph2;

    typedef IterableGraphExtender<

      MergeNodeGraphWrapperBase<_Graph1, _Graph2> > Parent;

  protected:

    MergeNodeGraphWrapper() { }

  public:

    MergeNodeGraphWrapper(_Graph1& _graph1, _Graph2& _graph2) { 

      Parent::Parent1::setGraph(_graph1);

      Parent::Parent2::setGraph(_graph2);

    }

  };

  /*! A base class for merging the node-sets and edge-sets of 

    two node-disjoint graphs 

    into one graph.

   */

  template <typename _Graph1, typename _Graph2, typename Enable=void>

  class MergeEdgeGraphWrapperBase : 

    public MergeNodeGraphWrapperBase<_Graph1, _Graph2> {

  public:

    void printEdge() const { std::cout << "generic" << std::endl; }

    typedef _Graph1 Graph1;

    typedef _Graph2 Graph2;

    typedef MergeNodeGraphWrapperBase<_Graph1, _Graph2> Parent;

    typedef typename Parent::Parent1 Parent1;

    typedef typename Parent::Parent2 Parent2;

//     typedef P1<_Graph1> Parent1;

//     typedef P2<_Graph2> Parent2;

    typedef typename Parent1::Edge Graph1Edge;

    typedef typename Parent2::Edge Graph2Edge;

  protected:

    MergeEdgeGraphWrapperBase() { }

  public:

    template <typename _Value> class EdgeMap;

    typedef typename Parent::Node Node;

    class Edge : public Graph1Edge, public Graph2Edge {

      friend class MergeEdgeGraphWrapperBase<_Graph1, _Graph2>;

      template <typename Value> friend class EdgeMap;

    protected:

      bool backward; //true, iff backward

    public:

      Edge() { }

      /// \todo =false is needed, or causes problems?

      /// If \c _backward is false, then we get an edge corresponding to the 

      /// original one, otherwise its oppositely directed pair is obtained.

      Edge(const Graph1Edge& n1, 

	   const Graph2Edge& n2, bool _backward) : 

	Graph1Edge(n1), Graph2Edge(n2), backward(_backward) { }

      Edge(Invalid i) : Graph1Edge(i), Graph2Edge(i), backward(true) { }

      bool operator==(const Edge& v) const { 

	return (this->backward==v.backward && 

		static_cast<Graph1Edge>(*this)==

		static_cast<Graph1Edge>(v) && 

		static_cast<Graph2Edge>(*this)==

		static_cast<Graph2Edge>(v));

      } 

      bool operator!=(const Edge& v) const { 

	return (this->backward!=v.backward || 

		static_cast<Graph1Edge>(*this)!=

		static_cast<Graph1Edge>(v) || 

		static_cast<Graph2Edge>(*this)!=

		static_cast<Graph2Edge>(v));

      }

    };

    using Parent::first;

    void first(Edge& i) const {

      Parent1::graph->first(*static_cast<Graph1Edge*>(&i));

      i.backward=false;

      if (*static_cast<Graph1Edge*>(&i)==INVALID) {

	Parent2::graph->first(*static_cast<Graph2Edge*>(&i));

	i.backward=true;

      }

    }

    void firstIn(Edge& i, const Node& n) const {

      Parent1::graph->firstIn(*static_cast<Graph1Edge*>(&i), n);

      i.backward=false;

      if (*static_cast<Graph1Edge*>(&i)==INVALID) {

	Parent2::graph->firstIn(*static_cast<Graph2Edge*>(&i), n);

	i.backward=true;

      }

    }

    void firstOut(Edge& i, const Node& n) const {

      Parent1::graph->firstOut(*static_cast<Graph1Edge*>(&i), n);

      i.backward=false;

      if (*static_cast<Graph1Edge*>(&i)==INVALID) {

	Parent2::graph->firstOut(*static_cast<Graph2Edge*>(&i), n);

	i.backward=true;

      }

    }

    using Parent::next;

    void next(Edge& i) const {

      if (!(i.backward)) {

	Parent1::graph->next(*static_cast<Graph1Edge*>(&i));

	if (*static_cast<Graph1Edge*>(&i)==INVALID) {

	  Parent2::graph->first(*static_cast<Graph2Edge*>(&i));

	  i.backward=true;

	}

      } else {

	Parent2::graph->next(*static_cast<Graph2Edge*>(&i));

      }

    }

    void nextIn(Edge& i) const {

      if (!(i.backward)) {

	Parent1::graph->nextIn(*static_cast<Graph1Edge*>(&i));

	if (*static_cast<Graph1Edge*>(&i)==INVALID) {

	  Parent2::graph->first(*static_cast<Graph2Edge*>(&i));

	  i.backward=true;

	}

      } else {

	Parent2::graph->nextIn(*static_cast<Graph2Edge*>(&i));

      }

    }

    void nextOut(Edge& i) const {

      if (!(i.backward)) {

	Parent1::graph->nextOut(*static_cast<Graph1Edge*>(&i));

	if (*static_cast<Graph1Edge*>(&i)==INVALID) {

	  Parent2::graph->first(*static_cast<Graph2Edge*>(&i));

	  i.backward=true;

	}

      } else {

	Parent2::graph->nextOut(*static_cast<Graph2Edge*>(&i));

      }

    }

    Node source(const Edge& i) const {

      if (!(i.backward)) {

	return 

	  Node(Parent1::graph->source(i), INVALID, false);

      } else {

	return 

	  Node(INVALID, Parent2::graph->source(i), true);

      }

    }

    Node target(const Edge& i) const {

      if (!(i.backward)) {

	return 

	  Node(Parent1::graph->target(i), INVALID, false);

      } else {

	return 

	  Node(INVALID, Parent2::graph->target(i), true);

      }

    }

    using Parent::id;

    int id(const Edge& n) const { 

      if (!n.backward) 

	return this->Parent1::graph->id(n);

      else

	return this->Parent2::graph->id(n);

    }

    template <typename _Value> 

    class EdgeMap : public Parent1::template EdgeMap<_Value>, 

		    public Parent2::template EdgeMap<_Value> { 

      typedef typename Parent1::template EdgeMap<_Value> ParentMap1;

      typedef typename Parent2::template EdgeMap<_Value> ParentMap2;

    public:

      typedef _Value Value;

      typedef Edge Key;

      EdgeMap(const MergeEdgeGraphWrapperBase<_Graph1, _Graph2>& gw) : 

	ParentMap1(gw), ParentMap2(gw) { }

      EdgeMap(const MergeEdgeGraphWrapperBase<_Graph1, _Graph2>& gw, 

	      const _Value& value) : 

	ParentMap1(gw, value), ParentMap2(gw, value) { }

      _Value operator[](const Edge& n) const {

	if (!n.backward) 

	  return ParentMap1::operator[](n);

	else 

	  return ParentMap2::operator[](n);

      }

      void set(const Edge& n, const _Value& value) {

	if (!n.backward) 

	  ParentMap1::set(n, value);

	else 

	  ParentMap2::set(n, value);

      }

//       using ParentMap1::operator[];

//       using ParentMap2::operator[];

    };

  };

  template <typename _Graph1, typename _Graph2>

  class MergeEdgeGraphWrapper : public 

  IterableGraphExtender<MergeEdgeGraphWrapperBase<_Graph1, _Graph2> > {

  public:

    typedef _Graph1 Graph1;

    typedef _Graph2 Graph2;

    typedef IterableGraphExtender<

      MergeEdgeGraphWrapperBase<_Graph1, _Graph2> > Parent;

  protected:

    MergeEdgeGraphWrapper() { }

  public:

    MergeEdgeGraphWrapper(_Graph1& _graph1, _Graph2& _graph2) { 

      Parent::Parent1::setGraph(_graph1);

      Parent::Parent2::setGraph(_graph2);

    }

  };

  template <typename _Graph, typename _EdgeSetGraph>

  class NewEdgeSetGraphWrapperBase : public GraphWrapperBase<_Graph> {

  public:

    typedef GraphWrapperBase<_Graph> Parent; 

    typedef _Graph Graph;

    typedef _EdgeSetGraph EdgeSetGraph;

    typedef typename _Graph::Node Node;

    typedef typename _EdgeSetGraph::Node ENode;

  protected:

    EdgeSetGraph* edge_set_graph;

    typename Graph::NodeMap<ENode>* e_node;

    typename EdgeSetGraph::NodeMap<Node>* n_node;

    void setEdgeSetGraph(EdgeSetGraph& _edge_set_graph) { 

      edge_set_graph=&_edge_set_graph; 

    }

    /// For each node of \c Graph, this gives a node of \c EdgeSetGraph .

    void setNodeMap(typename EdgeSetGraph::NodeMap<Node>& _n_node) { 

      n_node=&_n_node; 

    }

    /// For each node of \c EdgeSetGraph, this gives a node of \c Graph .

    void setENodeMap(typename Graph::NodeMap<ENode>& _e_node) { 

      e_node=&_e_node; 

    }

  public:

    class Edge : public EdgeSetGraph::Edge {

      typedef typename EdgeSetGraph::Edge Parent;

    public:

      Edge() { }

      Edge(const Parent& e) : Parent(e) { }

      Edge(Invalid i) : Parent(i) { }

    };

    using Parent::first;

    void first(Edge &e) const { 

      edge_set_graph->first(e);

    }

    void firstOut(Edge& e, const Node& n) const {

//       cout << e_node << endl;

//       cout << n_node << endl;

      edge_set_graph->firstOut(e, (*e_node)[n]);

    }

    void firstIn(Edge& e, const Node& n) const {

      edge_set_graph->firstIn(e, (*e_node)[n]);

    }

    using Parent::next;

    void next(Edge &e) const { 

      edge_set_graph->next(e);

    }

    void nextOut(Edge& e) const {

      edge_set_graph->nextOut(e);

    }

    void nextIn(Edge& e) const {

      edge_set_graph->nextIn(e);

    }

    Node source(const Edge& e) const { 

      return (*n_node)[edge_set_graph->source(e)];

    }

    Node target(const Edge& e) const { 

      return (*n_node)[edge_set_graph->target(e)];

    }

    int edgeNum() const { return edge_set_graph->edgeNum(); }

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

      return edge_set_graph->addEdge((*e_node)[u], (*e_node)[v]);

    }

    using Parent::erase;

    void erase(const Edge& i) const { edge_set_graph->erase(i); }

    void clear() const { Parent::clear(); edge_set_graph->clear(); }

    bool forward(const Edge& e) const { return edge_set_graph->forward(e); }

    bool backward(const Edge& e) const { return edge_set_graph->backward(e); }

    using Parent::id;

    int id(const Edge& e) const { return edge_set_graph->id(e); }

    Edge opposite(const Edge& e) const { return edge_set_graph->opposite(e); }

    template <typename _Value>

    class EdgeMap : public EdgeSetGraph::EdgeMap<_Value> {

    public:

      typedef typename EdgeSetGraph::EdgeMap<_Value> Parent; 

      typedef _Value Value;

      typedef Edge Key;

      EdgeMap(const NewEdgeSetGraphWrapperBase& gw) : 

	Parent(*(gw.edge_set_graph)) { }

      EdgeMap(const NewEdgeSetGraphWrapperBase& gw, const _Value& _value) : 

	Parent(*(gw.edge_set_graph), _value) { }

    };

  };

  template <typename _Graph, typename _EdgeSetGraph>

  class NewEdgeSetGraphWrapper : 

    public IterableGraphExtender<

    NewEdgeSetGraphWrapperBase<_Graph, _EdgeSetGraph> > {

  public:

    typedef _Graph Graph;

    typedef _EdgeSetGraph EdgeSetGraph;

    typedef IterableGraphExtender<

      NewEdgeSetGraphWrapper<_Graph, _EdgeSetGraph> > Parent;

  protected:

    NewEdgeSetGraphWrapper() { }

  public:

    NewEdgeSetGraphWrapper(_Graph& _graph, 

			   _EdgeSetGraph& _edge_set_graph, 

			   typename _Graph::

			   NodeMap<typename _EdgeSetGraph::Node>& _e_node, 

			   typename _EdgeSetGraph::

			   NodeMap<typename _Graph::Node>& _n_node) { 

      setGraph(_graph);

      setEdgeSetGraph(_edge_set_graph);

      setNodeMap(_n_node);

      setENodeMap(_e_node);

    }

  };

} //namespace lemon

#endif //LEMON_MERGE_NODE_GRAPH_WRAPPER_H