/* Copyright (c) 1997-2010
   Ewgenij Gawrilow, Michael Joswig (Technische Universitaet Darmstadt, Germany)
   http://www.polymake.de

   This program is free software; you can redistribute it and/or modify it
   under the terms of the GNU General Public License as published by the
   Free Software Foundation; either version 2, or (at your option) any
   later version: http://www.gnu.org/licenses/gpl.txt.

   This program is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License for more details.
--------------------------------------------------------------------------------
   $Project: polymake $$Id: IndexedSubgraph.h 9991 2010-12-12 23:36:28Z gawrilow $
*/

#ifndef POLYMAKE_INDEXED_SUBGRAPH_H
#define POLYMAKE_INDEXED_SUBGRAPH_H

#include "polymake/IndexedSubset.h"
#include "polymake/GenericGraph.h"
#include <cassert>

namespace pm {

template <typename IteratorPair, typename Operation>
class subgraph_node_iterator : public IteratorPair {
   typedef IteratorPair _super;
public:
   typedef subgraph_node_iterator<typename iterator_traits<IteratorPair>::iterator, Operation>
      iterator;
   typedef subgraph_node_iterator<typename iterator_traits<IteratorPair>::const_iterator, Operation>
      const_iterator;

   typedef binary_helper<IteratorPair,Operation> helper;
   typedef typename helper::operation operation;
protected:
   operation op;
public:
   subgraph_node_iterator() {}

   template <typename Operation2>
   subgraph_node_iterator(const subgraph_node_iterator<typename iterator_traits<IteratorPair>::iterator, Operation2>& it)
      : _super(it), op(helper::create(it.op)) {}

   subgraph_node_iterator(const IteratorPair& it_arg, const Operation& op_arg=Operation())
      : _super(it_arg), op(helper::create(op_arg)) {}

   subgraph_node_iterator(const typename IteratorPair::first_type& first_arg,
                          const typename IteratorPair::second_type& second_arg,
                          const Operation& op_arg=Operation())
      : _super(first_arg,second_arg), op(helper::create(op_arg)) {}
   subgraph_node_iterator(const typename IteratorPair::first_type& first_arg,
                          typename alt_constructor<typename IteratorPair::second_type>::arg_type& second_arg,
                          const Operation& op_arg=Operation())
      : _super(first_arg,second_arg), op(helper::create(op_arg)) {}
   subgraph_node_iterator(typename alt_constructor<typename IteratorPair::first_type>::arg_type& first_arg,
                          const typename IteratorPair::second_type& second_arg,
                          const Operation& op_arg=Operation())
      : _super(first_arg,second_arg), op(helper::create(op_arg)) {}
   subgraph_node_iterator(typename alt_constructor<typename IteratorPair::first_type>::arg_type& first_arg,
                          typename alt_constructor<typename IteratorPair::second_type>::arg_type& second_arg,
                          const Operation& op_arg=Operation())
      : _super(first_arg,second_arg), op(helper::create(op_arg)) {}

   typedef typename operation::out_edge_list out_edge_list_ref;
   typedef typename operation::in_edge_list in_edge_list_ref;
   typedef typename operation::out_adjacent_node_list out_adjacent_node_list_ref;
   typedef typename operation::in_adjacent_node_list in_adjacent_node_list_ref;

   out_edge_list_ref out_edges() const
   {
      return op.out_edges(*this, *helper::get2(this->second));
   }
   in_edge_list_ref in_edges() const
   {
      return op.in_edges(*this, *helper::get2(this->second));
   }

   int out_degree() const
   {
      return op.out_degree(*this, *helper::get2(this->second));
   }
   int in_degree() const
   {
      return op.in_degree(*this, *helper::get2(this->second));
   }

   out_adjacent_node_list_ref out_adjacent_nodes() const
   {
      return op.out_adjacent_nodes(*this, *helper::get2(this->second));
   }
   in_adjacent_node_list_ref in_adjacent_nodes() const
   {
      return op.in_adjacent_nodes(*this, *helper::get2(this->second));
   }
};

struct subgraph_node_access_constructor : binary_transform_constructor<> {
   template <typename IteratorPair, typename Operation, typename ExpectedFeatures>
   struct defs : binary_transform_constructor<>::defs<IteratorPair,Operation,ExpectedFeatures> {
      typedef subgraph_node_iterator<IteratorPair,Operation> iterator;
   };
};

struct subgraph_edge_accessor {
   typedef int first_argument_type;
   typedef void second_argument_type;
   typedef int result_type;
   template <typename Iterator2>
   int operator() (int edge_id, const Iterator2&) const { return edge_id; }

   template <typename IteratorPair>
   class mix_in : public IteratorPair {
      typedef typename IteratorPair::first_type Iterator1;      // runs along the full edge list
   public:
      mix_in() {}
      mix_in(const typename IteratorPair::first_type& first_arg,
             const typename IteratorPair::second_type& second_arg)
         : IteratorPair(first_arg,second_arg) {}
      mix_in(typename alt_constructor<typename IteratorPair::first_type>::arg_type& first_arg,
             const typename IteratorPair::second_type& second_arg)
         : IteratorPair(first_arg,second_arg) {}

      int from_node() const
      {
         return (Iterator1::symmetric || Iterator1::row_oriented)
                ? *Iterator1::second
                : this->second.index();
      }

      int to_node() const
      {
         return (Iterator1::symmetric || Iterator1::row_oriented)
                ? this->second.index()
                : *Iterator1::second;
      }
   };
};

template <typename EdgeListRef>
class subgraph_edge_list
   : public container_pair_impl< subgraph_edge_list<EdgeListRef>,
                                 list( Container1< EdgeListRef >,
                                       Container2< constant_value_container<int> > ) > {
protected:
   alias<EdgeListRef> edges;
   int own_index;
public:
   subgraph_edge_list(typename alias<EdgeListRef>::arg_type edges_arg, int index_arg)
      : edges(edges_arg), own_index(index_arg) {}

   typename alias<EdgeListRef>::reference get_container1() { return edges; }
   typename alias<EdgeListRef>::const_reference get_container1() const { return edges; }
   constant_value_container<int> get_container2() const { return own_index; }

   int dim() const { return get_container1().dim(); }
};

template <typename EdgeListRef>
struct check_container_feature<subgraph_edge_list<EdgeListRef>, sparse_compatible> : True {};

template <typename Iterator1Ref, typename Iterator2Ref>
struct construct_subgraph_edge_list {
   typedef Iterator1Ref first_argument_type;
   typedef Iterator2Ref second_argument_type;
   typedef subgraph_edge_list<typename deref<Iterator1Ref>::type::reference> edge_container;
   typedef IndexedSlice<edge_container, typename deref<Iterator2Ref>::type::reference,
                        cons< Hint<sparse>,
                              Operation< pair< subgraph_edge_accessor,
                                               operations::apply2< BuildUnaryIt<operations::index2element> > > > > >
      result_type;

   result_type operator() (first_argument_type it1, second_argument_type it2) const
   {
      return result_type(edge_container(*it1,it1.index()), *it2);
   }
};

template <typename GraphRef, typename SetRef, typename Params>
class IndexedSubgraph_base
   : public container_pair_base<GraphRef, typename Diligent<SetRef>::type> {
   typedef container_pair_base<GraphRef, typename Diligent<SetRef>::type> _base;
public:
   typedef typename deref<GraphRef>::type graph_type;
   typedef typename deref<SetRef>::type node_set_type;
protected:
   static const bool _renumber_nodes=extract_bool_param<Params,Renumber>::value;

   typename inherit_const<graph_type, GraphRef>::type& get_graph() { return _base::get_container1(); }
   const graph_type& get_graph() const { return _base::get_container1(); }
   const alias<typename Diligent<SetRef>::type>& get_node_set_alias() const { return this->src2; }
   typename alias<typename Diligent<SetRef>::type>::const_reference get_node_set() const { return _base::get_container2(); }

   IndexedSubgraph_base(typename _base::first_arg_type graph_arg, typename alias<SetRef>::arg_type node_set_arg)
      : _base(graph_arg, diligent(node_set_arg)) {}

   typedef typename concat_if<_renumber_nodes, cons< Renumber<True>, ExpectedFeatures<indexed> >, Hidden<IndexedSubgraph_base> >::type
      node_selector_params;

   template <typename Source>
   class node_selector
      : public indexed_subset_impl< node_selector<Source>,
                                    list( Container1< Source >,
                                          Container2< SetRef >,
                                          node_selector_params ) > {
      typedef indexed_subset_impl<node_selector> _super;
   public:
      typename _super::container1& get_container1()
      {
         return this->hidden().get_graph().template pretend<typename _super::container1&>();
      }
      const typename _super::container1& get_container1() const
      {
         return this->hidden().get_graph().template pretend<const typename _super::container1&>();
      }
      const node_set_type& get_container2() const
      {
         return this->hidden().get_node_set();
      }
   };

   template <typename Source, typename AddParams>
   class masquerade_container
      : public modified_container_pair_impl< masquerade_container<Source,AddParams>,
                                             list( Container1< node_selector<Source> >,
                                                   Container2< constant_value_container<typename Diligent<SetRef>::type> >,
                                                   Hidden< IndexedSubgraph_base >,
                                                   AddParams ) > {
      typedef modified_container_pair_impl<masquerade_container> _super;
   public:
      const typename _super::container2& get_container2() const
      {
         return constant(this->hidden().get_node_set_alias());
      }
   };

   typedef typename if_else<_renumber_nodes,
                            BuildBinaryIt<construct_subgraph_edge_list>,
                            operations::construct_binary2<IndexedSubset, Hint<sparse> > >::type
      edge_list_operation;
   typedef typename if_else<_renumber_nodes,
                            operations::construct_binary2<IndexedSlice, Hint<sparse> >,
                            operations::construct_binary2<LazySet2, set_intersection_zipper> >::type
      adjacent_node_list_operation;

   template <typename Iterator>
   struct node_accessor {
      typedef Iterator first_argument_type;
      typedef SetRef second_argument_type;
      typedef typename function_argument<SetRef>::const_type second_arg_type;
      typedef typename iterator_traits<Iterator>::reference result_type;
      typedef typename constant_value_container<typename Diligent<SetRef>::type>::const_iterator ConstIterator2;
   private:
      typename Iterator::out_edge_list_ref out_intermed(const Iterator& it, False) const { return it.out_edges(); }
      typename Iterator::in_edge_list_ref in_intermed(const Iterator& it, False) const { return it.in_edges(); }

      subgraph_edge_list<typename Iterator::out_edge_list_ref> out_intermed(const Iterator& it, True) const
      { return subgraph_edge_list<typename Iterator::out_edge_list_ref>(it.out_edges(), it.index()); }
      subgraph_edge_list<typename Iterator::in_edge_list_ref> in_intermed(const Iterator& it, True) const
      { return subgraph_edge_list<typename Iterator::in_edge_list_ref>(it.in_edges(), it.index()); }

      static const bool is_const=identical<Iterator, typename container_traits<typename masquerade<Nodes,GraphRef>::type>::const_iterator>::value;
      typedef typename if_else<is_const,
                               typename deref<GraphRef>::type::out_edge_list_container::const_iterator,
                               typename deref<GraphRef>::type::out_edge_list_container::iterator>::type
         out_edge_lists_iterator;
      typedef typename if_else<is_const,
                               typename deref<GraphRef>::type::in_edge_list_container::const_iterator,
                               typename deref<GraphRef>::type::in_edge_list_container::iterator>::type
         in_edge_lists_iterator;
   public:
      typedef typename binary_op_builder<edge_list_operation, out_edge_lists_iterator, ConstIterator2>::operation::result_type
         out_edge_list;
      typedef typename binary_op_builder<edge_list_operation, in_edge_lists_iterator, ConstIterator2>::operation::result_type
         in_edge_list;
      typedef typename binary_op_builder<adjacent_node_list_operation, void, void,
                                         typename Iterator::out_adjacent_node_list_ref, SetRef>::operation::result_type
         out_adjacent_node_list;
      typedef typename binary_op_builder<adjacent_node_list_operation, void, void,
                                         typename Iterator::in_adjacent_node_list_ref, SetRef>::operation::result_type
         in_adjacent_node_list;

      out_edge_list out_edges(const Iterator& it, second_arg_type set) const
      {
         return out_edge_list(out_intermed(it, bool2type<_renumber_nodes>()),set);
      }
      in_edge_list in_edges(const Iterator& it, second_arg_type set) const
      {
         return in_edge_list(in_intermed(it, bool2type<_renumber_nodes>()),set);
      }
      out_adjacent_node_list out_adjacent_nodes(const Iterator& it, second_arg_type set) const
      {
         return out_adjacent_node_list(it.out_adjacent_nodes(),set);
      }
      in_adjacent_node_list in_adjacent_nodes(const Iterator& it, second_arg_type set) const
      {
         return in_adjacent_node_list(it.in_adjacent_nodes(),set);
      }
      int out_degree(const Iterator& it, second_arg_type set) const
      {
         return out_edges(it,set).size();
      }
      int in_degree(const Iterator& it, second_arg_type set) const
      {
         return in_edges(it,set).size();
      }
   };

   template <typename Source>
   class masquerade_node_container
      : public masquerade_container<Source,
                                    list( Operation< node_accessor<typename container_traits<Source>::iterator> >,
                                          IteratorConstructor< subgraph_node_access_constructor > ) > {};
public:
   typedef masquerade_node_container<typename if_else<attrib<GraphRef>::is_const,
                                                      typename graph_type::const_node_container_ref,
                                                      typename graph_type::node_container_ref>::type>
      node_container;
   typedef masquerade_node_container<typename graph_type::const_node_container_ref>
      const_node_container;
   typedef typename inherit_const<node_container, GraphRef>::type& node_container_ref;
   typedef const const_node_container& const_node_container_ref;

   typedef masquerade_container<typename if_else<attrib<GraphRef>::is_const,
                                                 typename graph_type::const_out_edge_list_container_ref,
                                                 typename graph_type::out_edge_list_container_ref>::type,
                                Operation< edge_list_operation > >
      out_edge_list_container;
   typedef masquerade_container<typename graph_type::const_out_edge_list_container_ref,
                                Operation< edge_list_operation > >
      const_out_edge_list_container;
   typedef typename inherit_const<out_edge_list_container, GraphRef>::type& out_edge_list_container_ref;
   typedef const const_out_edge_list_container& const_out_edge_list_container_ref;

   typedef masquerade_container<typename if_else<attrib<GraphRef>::is_const,
                                                 typename graph_type::const_in_edge_list_container_ref,
                                                 typename graph_type::in_edge_list_container_ref>::type,
                                Operation< edge_list_operation > >
      in_edge_list_container;
   typedef masquerade_container<typename graph_type::const_in_edge_list_container_ref,
                                Operation< edge_list_operation > >
      const_in_edge_list_container;
   typedef typename inherit_const<in_edge_list_container, GraphRef>::type& in_edge_list_container_ref;
   typedef const const_in_edge_list_container& const_in_edge_list_container_ref;

   typedef typename out_edge_list_container::value_type out_edge_list;
   typedef typename in_edge_list_container::value_type in_edge_list;
   typedef typename const_out_edge_list_container::value_type const_out_edge_list;
   typedef typename const_in_edge_list_container::value_type const_in_edge_list;
   typedef out_edge_list out_edge_list_ref;
   typedef const_out_edge_list const_out_edge_list_ref;
   typedef in_edge_list in_edge_list_ref;
   typedef const_in_edge_list const_in_edge_list_ref;

   typedef masquerade_container<typename graph_type::const_adjacency_rows_container_ref,
                                Operation< adjacent_node_list_operation > >
      adjacency_rows_container;

   typedef masquerade_container<typename graph_type::const_adjacency_cols_container_ref,
                                Operation< adjacent_node_list_operation > >
      adjacency_cols_container;

   typedef const adjacency_rows_container& adjacency_rows_container_ref;
   typedef adjacency_rows_container_ref const_adjacency_rows_container_ref;
   typedef const adjacency_cols_container& adjacency_cols_container_ref;
   typedef adjacency_cols_container_ref const_adjacency_cols_container_ref;

   typedef typename adjacency_rows_container::value_type out_adjacent_node_list;
   typedef typename adjacency_cols_container::value_type in_adjacent_node_list;
   typedef out_adjacent_node_list out_adjacent_node_list_ref;
   typedef out_adjacent_node_list const_out_adjacent_node_list_ref;
   typedef in_adjacent_node_list in_adjacent_node_list_ref;
   typedef in_adjacent_node_list const_in_adjacent_list_ref;
};

template <typename GraphRef, typename SetRef, typename Params=void>
struct subgraph_random_access {
   static const bool value= container_traits<typename deref<GraphRef>::type::node_container_ref>::is_random &&
                            (!extract_bool_param<Params,Renumber>::value ||
                             subset_classifier::index_helper<masquerade<Nodes,GraphRef>, SetRef, false>::random);
};

template <typename GraphRef, typename SetRef, typename Params,
          bool _has_random=subgraph_random_access<GraphRef,SetRef,Params>::value>
class IndexedSubgraph_random_access_methods {};

template <typename GraphRef, typename SetRef, typename Params=void>
class IndexedSubgraph
   : public IndexedSubgraph_base<GraphRef, SetRef, Params>,
     public IndexedSubgraph_random_access_methods<GraphRef,SetRef,Params>,
     public GenericGraph< IndexedSubgraph<GraphRef,SetRef,Params>, typename deref<GraphRef>::type::dir > {
   typedef IndexedSubgraph_base<GraphRef, SetRef, Params> _base;
   friend class IndexedSubgraph_random_access_methods<GraphRef,SetRef,Params>;
protected:
   int _nodes(False) const { return this->get_node_set().size(); }
   int _nodes(True) const { return this->get_graph().nodes()-this->get_node_set().base().size(); }
   int _dim(False) const { return this->get_graph().dim(); }
   int _dim(True) const { return nodes(); }
   int _first_node(False) const { return this->get_node_set().front(); }
   int _first_node(True) const { return -1; }

public:
   IndexedSubgraph(typename _base::first_arg_type graph_arg, typename alias<SetRef>::arg_type node_set_arg)
      : _base(graph_arg, node_set_arg) {}

   int nodes() const { return _nodes(complement_helper<SetRef>()); }
   int edges() const;
   int dim() const { return _dim(typename extract_param<Params, Renumber<False> >::type()); }

   bool has_gaps() const
   {
      return !extract_bool_param<Params,Renumber>::value &&
             !(identical<typename deref<SetRef>::type, sequence>::value && _first_node(complement_helper<SetRef>())==0);
   }

   template <typename MasqueradeRef>
   MasqueradeRef pretend()
   {
      return reinterpret_cast<MasqueradeRef>(*this);
   }
   template <typename MasqueradeRef>
   typename attrib<MasqueradeRef>::plus_const pretend() const
   {
      return reinterpret_cast<MasqueradeRef>(*this);
   }
};

template <typename GraphRef, typename SetRef, typename Params>
int IndexedSubgraph<GraphRef,SetRef,Params>::edges() const
{
   int cnt=0;
   for (typename Nodes<IndexedSubgraph>::const_iterator n_it=entire(pm::nodes(*this)); !n_it.at_end(); ++n_it)
      cnt+=n_it.out_degree();
   if (deref<GraphRef>::type::dir::value) cnt/=2;
   return cnt;
}

template <typename GraphRef, typename SetRef, typename Params>
class IndexedSubgraph_random_access_methods<GraphRef, SetRef, Params, true> {
   typedef IndexedSubgraph<GraphRef, SetRef, Params> master;
   typedef IndexedSubgraph_base<GraphRef, SetRef, Params> base;
   static const bool _is_directed= deref<GraphRef>::type::dir::value==graph::Directed::value;

   master& me() { return static_cast<master&>(*this); }
   const master& me() const { return static_cast<const master&>(*this); }

   int _node_index(int n, False) const
   {
      assert(me().get_node_set().contains(n));
      return n;
   }
   int _node_index(int n, True) const
   {
      return me().get_node_set()[n];
   }
   int _node_index(int n) const
   {
      return _node_index(n, typename extract_type_param<Params,Renumber,False>::type());
   }
public:
   typename base::out_edge_list out_edges(int n)
   {
      return typename base::out_edge_list(me().get_graph().out_edges(_node_index(n)), me().get_node_set());
   }
   typename base::const_out_edge_list out_edges(int n) const
   {
      return typename base::const_out_edge_list(me().get_graph().out_edges(_node_index(n)), me().get_node_set());
   }
   typename base::in_edge_list in_edges(int n)
   {
      return typename base::in_edge_list(me().get_graph().in_edges(_node_index(n)), me().get_node_set());
   }
   typename base::const_in_edge_list in_edges(int n) const
   {
      return typename base::const_in_edge_list(me().get_graph().in_edges(_node_index(n)), me().get_node_set());
   }

   int out_degree(int n) const
   {
      return out_edges(n).size();
   }
   int in_degree(int n) const
   {
      return in_edges(n).size();
   }
   int degree (int n) const
   {
      int d=out_degree(n);
      if (_is_directed) d+=in_degree(n);
      return d;
   }

   typename base::out_adjacent_node_list out_adjacent_nodes(int n) const
   {
      return typename base::out_adjacent_node_list(me().get_graph().out_adjacent_nodes(_node_index(n)), me().get_node_set());
   }
   typename base::in_adjacent_node_list in_adjacent_nodes(int n) const
   {
      return typename base::in_adjacent_node_list(me().get_graph().in_adjacent_nodes(_node_index(n)), me().get_node_set());
   }

   int edge(int n1, int n2)
   {
      return me().get_graph().edge(_node_index(n1),_node_index(n2));
   }
   int edge(int n1, int n2) const
   {
      return me().get_graph().edge(_node_index(n1),_node_index(n2));
   }

   bool edge_exists(int n1, int n2) const
   {
      return me().get_graph().edge_exists(_node_index(n1),_node_index(n2));
   }
   void delete_edge(int n1, int n2)
   {
      me().get_graph().delete_edge(_node_index(n1),_node_index(n2));
   }
};

template <typename GraphRef, typename SetRef, typename Params> inline
const IndexedSubgraph<GraphRef, SetRef, typename replace_params<Params, Renumber<True> >::type >&
renumber_nodes(const IndexedSubgraph<GraphRef,SetRef,Params>& G)
{
   return reinterpret_cast<const IndexedSubgraph<GraphRef, SetRef, typename replace_params<Params, Renumber<True> >::type >&>(G);
}

template <typename GraphRef, typename SetRef, typename Params>
struct spec_object_traits< IndexedSubgraph<GraphRef,SetRef,Params> >
   : spec_object_traits<is_opaque> {
   static const bool is_temporary=true,
                     is_always_const=effectively_const<GraphRef>::value;
   static const int is_resizeable=0;
};

template <typename Graph, typename Set> inline
IndexedSubgraph<typename Unwary<Graph>::type&, const typename Concrete<Set>::type&>
induced_subgraph(GenericGraph<Graph>& G, const Set& nodes)
{
   if (POLYMAKE_DEBUG || !Unwary<Graph>::value) {
      if (!set_within_range(nodes, G.nodes()))
         throw std::runtime_error("induced_subgraph - node indices out of range");
   }
   return IndexedSubgraph<typename Unwary<Graph>::type&, const typename Concrete<Set>::type&>(G.top(), concrete(nodes));
}

template <typename Graph, typename Set> inline
IndexedSubgraph<const typename Unwary<Graph>::type&, const typename Concrete<Set>::type&>
induced_subgraph(const GenericGraph<Graph>& G, const Set& nodes)
{
   if (POLYMAKE_DEBUG || !Unwary<Graph>::value) {
      if (!set_within_range(nodes, G.nodes()))
         throw std::runtime_error("induced_subgraph - node indices out of range");
   }
   return IndexedSubgraph<const typename Unwary<Graph>::type&, const typename Concrete<Set>::type&>(G.top(), concrete(nodes));
}

} // end namespace pm

#endif // POLYMAKE_INDEXED_GRAPH_H

// Local Variables:
// mode:C++
// c-basic-offset:3
// indent-tabs-mode:nil
// End:
