RhodeCode

/* -*- mode: C++; indent-tabs-mode: nil; -*-

 *

 * This file is a part of LEMON, a generic C++ optimization library.

 *

 * Copyright (C) 2003-2009

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, 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_LIST_GRAPH_H

#define LEMON_LIST_GRAPH_H

///\ingroup graphs

///\file

///\brief ListDigraph, ListGraph classes.

#include <lemon/core.h>

#include <lemon/error.h>

#include <lemon/bits/graph_extender.h>

#include <vector>

#include <list>

namespace lemon {

  class ListDigraphBase {

  protected:

    struct NodeT {

      int first_in, first_out;

      int prev, next;

    };

    struct ArcT {

      int target, source;

      int prev_in, prev_out;

      int next_in, next_out;

    };

    std::vector<NodeT> nodes;

    int first_node;

    int first_free_node;

    std::vector<ArcT> arcs;

    int first_free_arc;

  public:

    typedef ListDigraphBase Digraph;

    class Node {

      friend class ListDigraphBase;

    protected:

      int id;

      explicit Node(int pid) { id = pid;}

    public:

      Node() {}

      Node (Invalid) { id = -1; }

      bool operator==(const Node& node) const {return id == node.id;}

      bool operator!=(const Node& node) const {return id != node.id;}

      bool operator<(const Node& node) const {return id < node.id;}

    };

    class Arc {

      friend class ListDigraphBase;

    protected:

      int id;

      explicit Arc(int pid) { id = pid;}

    public:

      Arc() {}

      Arc (Invalid) { id = -1; }

      bool operator==(const Arc& arc) const {return id == arc.id;}

      bool operator!=(const Arc& arc) const {return id != arc.id;}

      bool operator<(const Arc& arc) const {return id < arc.id;}

    };

    ListDigraphBase()

      : nodes(), first_node(-1),

        first_free_node(-1), arcs(), first_free_arc(-1) {}

    int maxNodeId() const { return nodes.size()-1; }

    int maxArcId() const { return arcs.size()-1; }

    Node source(Arc e) const { return Node(arcs[e.id].source); }

    Node target(Arc e) const { return Node(arcs[e.id].target); }

    void first(Node& node) const {

      node.id = first_node;

    }

    void next(Node& node) const {

      node.id = nodes[node.id].next;

    }

    void first(Arc& arc) const {

      int n;

      for(n = first_node;

          n = nodes[n].next) {}

    }

    void next(Arc& arc) const {

      } else {

        int n;

            n = nodes[n].next) {}

      }

    }

    void firstOut(Arc &e, const Node& v) const {

      e.id = nodes[v.id].first_out;

    }

    void nextOut(Arc &e) const {

      e.id=arcs[e.id].next_out;

    }

    void firstIn(Arc &e, const Node& v) const {

      e.id = nodes[v.id].first_in;

    }

    void nextIn(Arc &e) const {

      e.id=arcs[e.id].next_in;

    }

    static int id(Node v) { return v.id; }

    static int id(Arc e) { return e.id; }

    static Node nodeFromId(int id) { return Node(id);}

    static Arc arcFromId(int id) { return Arc(id);}

    bool valid(Node n) const {

      return n.id >= 0 && n.id < static_cast<int>(nodes.size()) &&

        nodes[n.id].prev != -2;

    }

    bool valid(Arc a) const {

      return a.id >= 0 && a.id < static_cast<int>(arcs.size()) &&

        arcs[a.id].prev_in != -2;

    }

    Node addNode() {

      int n;

      if(first_free_node==-1) {

        n = nodes.size();

        nodes.push_back(NodeT());

      } else {

        n = first_free_node;

        first_free_node = nodes[n].next;

      }

      nodes[n].next = first_node;

      if(first_node != -1) nodes[first_node].prev = n;

      first_node = n;

      nodes[n].prev = -1;

      nodes[n].first_in = nodes[n].first_out = -1;

      return Node(n);

    }

    Arc addArc(Node u, Node v) {

      int n;

      if (first_free_arc == -1) {

        n = arcs.size();

        arcs.push_back(ArcT());

      } else {

        n = first_free_arc;

        first_free_arc = arcs[n].next_in;

      }

      arcs[n].source = u.id;

      arcs[n].target = v.id;

      arcs[n].next_out = nodes[u.id].first_out;

      if(nodes[u.id].first_out != -1) {

        arcs[nodes[u.id].first_out].prev_out = n;

      }

      arcs[n].next_in = nodes[v.id].first_in;

      if(nodes[v.id].first_in != -1) {

        arcs[nodes[v.id].first_in].prev_in = n;

      }

      arcs[n].prev_in = arcs[n].prev_out = -1;

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

      return Arc(n);

    }

    void erase(const Node& node) {

      int n = node.id;

      if(nodes[n].next != -1) {

        nodes[nodes[n].next].prev = nodes[n].prev;

      }

      if(nodes[n].prev != -1) {

        nodes[nodes[n].prev].next = nodes[n].next;

      } else {

        first_node = nodes[n].next;

      }

      nodes[n].next = first_free_node;

      first_free_node = n;

      nodes[n].prev = -2;

    }

    void erase(const Arc& arc) {

      int n = arc.id;

      if(arcs[n].next_in!=-1) {

        arcs[arcs[n].next_in].prev_in = arcs[n].prev_in;

      }

      if(arcs[n].prev_in!=-1) {

        arcs[arcs[n].prev_in].next_in = arcs[n].next_in;

      } else {

        nodes[arcs[n].target].first_in = arcs[n].next_in;

      }

      if(arcs[n].next_out!=-1) {

        arcs[arcs[n].next_out].prev_out = arcs[n].prev_out;

      }

      if(arcs[n].prev_out!=-1) {

        arcs[arcs[n].prev_out].next_out = arcs[n].next_out;

      } else {

        nodes[arcs[n].source].first_out = arcs[n].next_out;

      }

      arcs[n].next_in = first_free_arc;

      first_free_arc = n;

      arcs[n].prev_in = -2;

    }

    void clear() {

      arcs.clear();

      nodes.clear();

      first_node = first_free_node = first_free_arc = -1;

    }

  protected:

    void changeTarget(Arc e, Node n)

    {

      if(arcs[e.id].next_in != -1)

        arcs[arcs[e.id].next_in].prev_in = arcs[e.id].prev_in;

      if(arcs[e.id].prev_in != -1)

        arcs[arcs[e.id].prev_in].next_in = arcs[e.id].next_in;

      else nodes[arcs[e.id].target].first_in = arcs[e.id].next_in;

      if (nodes[n.id].first_in != -1) {

        arcs[nodes[n.id].first_in].prev_in = e.id;

      }

      arcs[e.id].target = n.id;

      arcs[e.id].prev_in = -1;

      arcs[e.id].next_in = nodes[n.id].first_in;

      nodes[n.id].first_in = e.id;

    }

    void changeSource(Arc e, Node n)

    {

      if(arcs[e.id].next_out != -1)

        arcs[arcs[e.id].next_out].prev_out = arcs[e.id].prev_out;

      if(arcs[e.id].prev_out != -1)

        arcs[arcs[e.id].prev_out].next_out = arcs[e.id].next_out;

      else nodes[arcs[e.id].source].first_out = arcs[e.id].next_out;

      if (nodes[n.id].first_out != -1) {

        arcs[nodes[n.id].first_out].prev_out = e.id;

      }

      arcs[e.id].source = n.id;

      arcs[e.id].prev_out = -1;

      arcs[e.id].next_out = nodes[n.id].first_out;

      nodes[n.id].first_out = e.id;

    }

  };

  typedef DigraphExtender<ListDigraphBase> ExtendedListDigraphBase;

  /// \addtogroup graphs

  /// @{

  ///A general directed graph structure.

  ///\ref ListDigraph is a simple and fast <em>directed graph</em>

  ///implementation based on static linked lists that are stored in

  ///\c std::vector structures.

  ///

  ///It conforms to the \ref concepts::Digraph "Digraph concept" and it

  ///also provides several useful additional functionalities.

  ///Most of the member functions and nested classes are documented

  ///only in the concept class.

  ///

  ///\sa concepts::Digraph