// -*- mode:C++ -*-

#ifndef SMART_GRAPH_H

#define SMART_GRAPH_H

#include <vector>

#include <limits.h>

#include <invalid.h>

namespace hugo {

  class SmartGraph {

//     static const int INVALID=-1;

//     static const int INVALID_NODE=INT_MAX;

    struct NodeT 

    {

      int first_in,first_out;      

      NodeT() : first_in(-1), first_out(-1) {}

    };

    struct EdgeT 

    {

      int head, tail, next_in, next_out;      

      //FIXME: is this necessary?

      EdgeT() : next_in(-1), next_out(-1) {}  

    };

    std::vector<NodeT> nodes;

    std::vector<EdgeT> edges;

    template <typename Key> class DynMapBase

    {

    protected:

      SmartGraph* G; 

    public:

      virtual void add(const Key k) = NULL;

      virtual void erase(const Key k) = NULL;

      DynMapBase(const SmartGraph &_G) : G(&_G) {}

      virtual ~DynMapBase() {}

      friend class SmartGraph;

    };

  public:

    template <typename T> class DynEdgeMap;

    template <typename T> class DynEdgeMap;

    class Node;

    class Edge;

  protected:

    mutable std::vector<DynMapBase<Node> * > dyn_node_maps;

    mutable std::vector<DynMapBase<Edge> * > dyn_edge_maps;

  public:

    class NodeIt;

    class EdgeIt;

    class OutEdgeIt;

    class InEdgeIt;

    //     class Node { int n; };

    //     class NodeIt : public Node { };

    //     class Edge { int n; };

    //     class EdgeIt : public Edge {};

    //     class OutEdgeIt : public Edge {};

    //     class InEdgeIt : public Edge {};

    //     class SymEdge;

    template <typename T> class NodeMap;

    template <typename T> class EdgeMap;

  public:

    /* default constructor */

    SmartGraph() : nodes(), edges() { }

    SmartGraph(const SmartGraph &_g) : nodes(_g.nodes), edges(_g.edges) { }

    ~SmartGraph()

    {

      for(std::vector<DynMapBase<Node> * >::iterator i=dyn_node_maps.begin();

	  i!=dyn_node_maps.end(); ++i) (**i).G=NULL;

      for(std::vector<DynMapBase<Edge> * >::iterator i=dyn_edge_maps.begin();

	  i!=dyn_edge_maps.end(); ++i) (**i).G=NULL;

    }

    int nodeNum() const { return nodes.size(); }  //FIXME: What is this?

    int edgeNum() const { return edges.size(); }  //FIXME: What is this?

    int maxNodeId() const { return nodes.size(); }  //FIXME: What is this?

    int maxEdgeId() const { return edges.size(); }  //FIXME: What is this?

    Node tail(Edge e) const { return edges[e.n].tail; }

    Node head(Edge e) const { return edges[e.n].head; }

//     Node aNode(const OutEdgeIt& e) const { return tail(e); }

//     Node aNode(const InEdgeIt& e) const { return head(e); }

//     //Node aNode(const SymEdge& e) const { return e.aNode(); }

//     Node bNode(const OutEdgeIt& e) const { return head(e); }

//     Node bNode(const InEdgeIt& e) const { return tail(e); }

//     //Node bNode(const SymEdge& e) const { return e.bNode(); }

    NodeIt& first(NodeIt& v) const { 

      v=NodeIt(*this); return v; }

    EdgeIt& first(EdgeIt& e) const { 

      e=EdgeIt(*this); return e; }

    OutEdgeIt& first(OutEdgeIt& e, const Node v) const { 

      e=OutEdgeIt(*this,v); return e; }

    InEdgeIt& first(InEdgeIt& e, const Node v) const { 

      e=InEdgeIt(*this,v); return e; }

    template< typename It >

    It first() const { 

      It e;

      getFirst(e);

      return e; 

    }

    template< typename It >

    It first(Node v) const { 

      It e;

      getFirst(e, v);

      return e; 

    }

    bool valid(Edge e) const { return e.n!=-1; }

    //    bool valid(EdgeIt e) const { return e.n<int(edges.size()); }

    bool valid(Node n) const { return n.n!=-1; }

    void setInvalid(Edge &e) { e.n=-1; }

    void setInvalid(Node &n) { n.n=-1; }

    template <typename It> It getNext(It it) const

    { It tmp(it); return next(tmp); }

    //{ It tmp; tmp.n=it.n+1; return tmp; }

    Node& next(Node& it) const { it.n=(it.n+2)%nodes.size()-1; return it; }

    OutEdgeIt& next(OutEdgeIt& it) const

    { it.n=edges[it.n].next_out; return it; }

    InEdgeIt& next(InEdgeIt& it) const

    { it.n=edges[it.n].next_in; return it; }

    EdgeIt& next(EdgeIt& it) const { --it.n; return it; }

    int id(Node v) const { return v.n; }

    int id(Edge e) const { return e.n; }

    Node addNode() {

      Node n; n.n=nodes.size();

      nodes.push_back(NodeT()); //FIXME: Hmmm...

      for(std::vector<DynMapBase<Node> * >::iterator i=dyn_node_maps.begin();

	  i!=dyn_node_maps.end(); ++i) (**i).add(n.n);

      return n;

    }

    Edge addEdge(Node u, Node v) {

      Edge e; e.n=edges.size(); edges.push_back(EdgeT()); //FIXME: Hmmm...

      edges[e.n].tail=u.n; edges[e.n].head=v.n;

      edges[e.n].next_out=nodes[u.n].first_out;

      edges[e.n].next_in=nodes[v.n].first_in;

      nodes[u.n].first_out=nodes[v.n].first_in=e.n;

      for(std::vector<DynMapBase<Edge> * >::iterator i=dyn_edge_maps.begin();

	  i!=dyn_edge_maps.end(); ++i) (**i).add(e);

      return e;

    }

    void clear() {nodes.clear();edges.clear();}

    class Node {

      friend class SmartGraph;

      template <typename T> friend class NodeMap;

      template <typename T> friend class DynNodeMap;

      friend class Edge;

      friend class OutEdgeIt;

      friend class InEdgeIt;

      friend class SymEdge;

    protected:

      int n;

      friend int SmartGraph::id(Node v) const; 

      Node(int nn) {n=nn;}

    public:

      Node() {}

      Node (Invalid i) { n=-1; }

      bool operator==(const Node i) const {return n==i.n;}

      bool operator!=(const Node i) const {return n!=i.n;}

      bool operator<(const Node i) const {return n<i.n;}

    };

    class NodeIt : public Node {

      friend class SmartGraph;

    public:

      NodeIt(const SmartGraph& G) : Node(G.nodes.size()?0:-1) { }

      NodeIt() : Node() { }

    };

    class Edge {

      friend class SmartGraph;

      template <typename T> friend class EdgeMap;

      template <typename T> friend class DynEdgeMap;

      friend class Node;

      friend class NodeIt;

    protected:

      int n;

      friend int SmartGraph::id(Edge e) const;

      Edge(int nn) {n=nn;}

    public:

      Edge() { }

      Edge (Invalid i) { n=-1; }

      bool operator==(const Edge i) const {return n==i.n;}

      bool operator!=(const Edge i) const {return n!=i.n;}

      bool operator<(const Edge i) const {return n<i.n;}

    };

    class EdgeIt : public Edge {

      friend class SmartGraph;

    public:

      EdgeIt(const SmartGraph& G) : Edge(G.edges.size()-1) { }

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

      EdgeIt() : Edge() { }

    };

    class OutEdgeIt : public Edge {

      friend class SmartGraph;

    public: 

      OutEdgeIt() : Edge() { }

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

      OutEdgeIt(const SmartGraph& G,const Node v)

	: Edge(G.nodes[v.n].first_out) {}

    };

    class InEdgeIt : public Edge {

      friend class SmartGraph;

    public: 

      InEdgeIt() : Edge() { }

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

      InEdgeIt(const SmartGraph& G,Node v) :Edge(G.nodes[v.n].first_in){}

    };

    // Map types

    template <typename T>

    class NodeMap {

      const SmartGraph& G; 

      std::vector<T> container;

    public:

      typedef T ValueType;

      typedef Node KeyType;

      NodeMap(const SmartGraph& _G) : G(_G), container(G.maxNodeId()) { }

      NodeMap(const SmartGraph& _G, T a) : 

	G(_G), container(G.maxNodeId(), a) { }

      void set(Node n, T a) { container[n.n]=a; }

      T get(Node n) const { return container[n.n]; }

      T& operator[](Node n) { return container[n.n]; }

      const T& operator[](Node n) const { return container[n.n]; }

      void update() { container.resize(G.maxNodeId()); }

      void update(T a) { container.resize(G.maxNodeId(), a); }

    };

    template <typename T>

    class EdgeMap {

      const SmartGraph& G; 

      std::vector<T> container;

    public:

      typedef T ValueType;

      typedef Edge KeyType;

      EdgeMap(const SmartGraph& _G) : G(_G), container(G.maxEdgeId()) { }

      EdgeMap(const SmartGraph& _G, T a) : 

	G(_G), container(G.maxEdgeId(), a) { }

      void set(Edge e, T a) { container[e.n]=a; }

      T get(Edge e) const { return container[e.n]; }

      T& operator[](Edge e) { return container[e.n]; } 

      const T& operator[](Edge e) const { return container[e.n]; } 

      void update() { container.resize(G.maxEdgeId()); }

      void update(T a) { container.resize(G.maxEdgeId(), a); }

    };

    template <typename T> class DynNodeMap : public DynMapBase<Node>

    {

      std::vector<T> container;

    public:

      typedef T ValueType;

      typedef Node KeyType;

      DynNodeMap(const SmartGraph &_G) :

	DynMapBase<Node>(_G), container(_G.maxNodeId())

      {

	//FIXME: What if there are empty Id's?

	//FIXME: Can I use 'this' in a constructor?

	G->dyn_node_maps.push_back(this);

      }

      ~DynNodeMap()

      {

	if(G) {

	  std::vector<DynMapBase<Node>* >::iterator i;

	  for(i=G->dyn_node_maps.begin();

	      i!=G->dyn_node_maps.end() && *i!=this; ++i) ;

	  //if(*i==this) G->dyn_node_maps.erase(i); //FIXME: Way too slow...

	  //A better way to do that: (Is this really important?)

	  if(*i==this) {

	    *i=G->dyn_node_maps.back();

	    G->dyn_node_maps.pop_back();

	  }

	}

      }

      void add(const Node k) 

      {

	if(k.n>=container.size()) container.resize(k.n+1);

      }

//       void erase(const Node k)

//       {

// 	//FIXME: Please implement me.

//       }

//       void erase(const Edge k)

//       {

// 	//FIXME: Please implement me.

//       }

      void set(Node n, T a) { container[n.n]=a; }

      T get(Node n) const { return container[n.n]; }

      T& operator[](Node n) { return container[n.n]; }

      const T& operator[](Node n) const { return container[n.n]; }

      void update() {}    //Useless for DynMaps

      void update(T a) {}  //Useless for DynMaps

    };

    template <typename T> class DynEdgeMap : public DynMapBase<Edge>

    {

      std::vector<T> container;

    public:

      typedef T ValueType;

      typedef Edge KeyType;

      DynEdgeMap(const SmartGraph &_G) :

	DynMapBase<Edge>(_G), container(_G.maxEdgeId())

      {

	//FIXME: What if there are empty Id's?

	//FIXME: Can I use 'this' in a constructor?

	G->dyn_edge_maps.push_back(this);

      }

      ~DynEdgeMap()

      {

	if(G) {

	  std::vector<DynMapBase<Edge>* >::iterator i;

	  for(i=G->dyn_edge_maps.begin();

	      i!=G->dyn_edge_maps.end() && *i!=this; ++i) ;

	  //if(*i==this) G->dyn_edge_maps.erase(i); //Way too slow...

	  //A better way to do that: (Is this really important?)

	  if(*i==this) {

	    *i=G->dyn_edge_maps.back();

	    G->dyn_edge_maps.pop_back();

	  }

	}

      }

      void add(const Edge k) 

      {

	if(k.n>=int(container.size())) container.resize(k.n+1);

      }

      void erase(const Edge k)

      {

	//FIXME: Please implement me.

      }

      void set(Edge n, T a) { container[n.n]=a; }

      T get(Edge n) const { return container[n.n]; }

      T& operator[](Edge n) { return container[n.n]; }

      const T& operator[](Edge n) const { return container[n.n]; }

      void update() {}    //Useless for DynMaps

      void update(T a) {}  //Useless for DynMaps

    };

  };

} //namespace hugo

#endif //SMART_GRAPH_H