lemon-0.x: src/work/list_graph.hh@6c8adcd6b482

     1 #ifndef LIST_GRAPH_HH

     2 #define LIST_GRAPH_HH

     4 #include <iostream>

     5 #include <vector>

     7 namespace marci {

     9   template <typename It>

    10   int count(It it) {

    11     int i=0;

    12     for( ; it.valid(); ++it) { ++i; }

    13     return i;

    14   }

    16   class ListGraph {

    18     class node_item;

    19     class edge_item;

    21   public:

    23     class NodeIt;

    24     class EachNodeIt;

    25     class EdgeIt;

    26     class EachEdgeIt;

    27     class OutEdgeIt;

    28     class InEdgeIt;

    29     class SymEdgeIt;

    30     template <typename T> class NodeMap;

    31     template <typename T> class EdgeMap;

    33   private:

    35     template <typename T> friend class NodeMap;

    36     template <typename T> friend class EdgeMap;

    38     template <typename T>

    39     class NodeMap {

    40       const ListGraph& G;

    41       std::vector<T> container;

    42     public:

    43       typedef T ValueType;

    44       typedef NodeIt KeyType;

    45       NodeMap(const ListGraph& _G) : G(_G), container(G.node_id) { }

    46       NodeMap(const ListGraph& _G, T a) :

    47 	G(_G), container(G.node_id, a) { }

    48       void set(NodeIt n, T a) { container[/*G.id(n)*/n.node->id]=a; }

    49       T get(NodeIt n) const { return container[/*G.id(n)*/n.node->id]; }

    50       T& operator[](NodeIt n) { return container[/*G.id(n)*/n.node->id]; }

    51       const T& operator[](NodeIt n) const { return container[/*G.id(n)*/n.node->id]; }

    52       void resize() { container.resize(G.node_id); }

    53       void resize(T a) { container.resize(G.node_id, a); }

    54     };

    56     template <typename T>

    57     class EdgeMap {

    58       const ListGraph& G;

    59       std::vector<T> container;

    60     public:

    61       typedef T ValueType;

    62       typedef EdgeIt KeyType;

    63       EdgeMap(const ListGraph& _G) : G(_G), container(G.edge_id) { }

    64       EdgeMap(const ListGraph& _G, T a) :

    65 	G(_G), container(G.edge_id, a) { }

    66       void set(EdgeIt e, T a) { container[/*G.id(e)*/e.edge->id]=a; }

    67       T get(EdgeIt e) const { return container[/*G.id(e)*/e.edge->id]; }

    68       T& operator[](EdgeIt e) { return container[/*G.id(e)*/e.edge->id]; }

    69       const T& operator[](EdgeIt e) const { return container[/*G.id(e)*/e.edge->id]; }

    70       void resize() { container.resize(G.edge_id); }

    71       void resize(T a) { container.resize(G.edge_id, a); }

    72     };

    74     int node_id;

    75     int edge_id;

    76     int _node_num;

    77     int _edge_num;

    79     node_item* _first_node;

    80     node_item* _last_node;

    82     class node_item {

    83       friend class ListGraph;

    84       template <typename T> friend class NodeMap;

    86       friend class NodeIt;

    87       friend class EachNodeIt;

    88       friend class EdgeIt;

    89       friend class EachEdgeIt;

    90       friend class OutEdgeIt;

    91       friend class InEdgeIt;

    92       friend class SymEdgeIt;

    93       friend std::ostream& operator<<(std::ostream& os, const NodeIt& i);

    94       friend std::ostream& operator<<(std::ostream& os, const EdgeIt& i);

    95       //ListGraph* G;

    96       int id;

    97       edge_item* _first_out_edge;

    98       edge_item* _last_out_edge;

    99       edge_item* _first_in_edge;

   100       edge_item* _last_in_edge;

   101       node_item* _next_node;

   102       node_item* _prev_node;

   103     public:

   104       node_item() { }

   105     };

   107     class edge_item {

   108       friend class ListGraph;

   109       template <typename T> friend class EdgeMap;

   111       friend class NodeIt;

   112       friend class EachNodeIt;

   113       friend class EdgeIt;

   114       friend class EachEdgeIt;

   115       friend class OutEdgeIt;

   116       friend class InEdgeIt;

   117       friend class SymEdgeIt;

   118       friend std::ostream& operator<<(std::ostream& os, const EdgeIt& i);

   119       //ListGraph* G;

   120       int id;

   121       node_item* _tail;

   122       node_item* _head;

   123       edge_item* _next_out;

   124       edge_item* _prev_out;

   125       edge_item* _next_in;

   126       edge_item* _prev_in;

   127     public:

   128       edge_item() { }

   129     };

   131     node_item* _add_node() {

   132       node_item* p=new node_item;

   133       p->id=node_id++;

   134       p->_first_out_edge=0;

   135       p->_last_out_edge=0;

   136       p->_first_in_edge=0;

   137       p->_last_in_edge=0;

   138       p->_prev_node=_last_node;

   139       p->_next_node=0;

   140       if (_last_node) _last_node->_next_node=p;

   141       _last_node=p;

   142       if (!_first_node) _first_node=p;

   144       ++_node_num;

   145       return p;

   146     }

   148     edge_item* _add_edge(node_item* _tail, node_item* _head) {

   149       edge_item* e=new edge_item;

   150       e->id=edge_id++;

   151       e->_tail=_tail;

   152       e->_head=_head;

   154       e->_prev_out=_tail->_last_out_edge;

   155       if (_tail->_last_out_edge) (_tail->_last_out_edge)->_next_out=e;

   156       _tail->_last_out_edge=e;

   157       if (!_tail->_first_out_edge) _tail->_first_out_edge=e;

   158       e->_next_out=0;

   160       e->_prev_in=_head->_last_in_edge;

   161       if (_head->_last_in_edge) (_head->_last_in_edge)->_next_in=e;

   162       _head->_last_in_edge=e;

   163       if (!_head->_first_in_edge) { _head->_first_in_edge=e; }

   164       e->_next_in=0;

   166       ++_edge_num;

   167       return e;

   168     }

   170     //deletes a node which has no out edge and no in edge

   171     void _delete_node(node_item* v) {

   172       if (v->_next_node) (v->_next_node)->_prev_node=v->_prev_node; else

   173 	_last_node=v->_prev_node;

   174       if (v->_prev_node) (v->_prev_node)->_next_node=v->_next_node; else

   175 	_first_node=v->_next_node;

   177       delete v;

   178       --_node_num;

   179     }

   181     void _delete_edge(edge_item* e) {

   182       if (e->_next_out) (e->_next_out)->_prev_out=e->_prev_out; else

   183 	(e->_tail)->_last_out_edge=e->_prev_out;

   184       if (e->_prev_out) (e->_prev_out)->_next_out=e->_next_out; else

   185 	(e->_tail)->_first_out_edge=e->_next_out;

   186       if (e->_next_in) (e->_next_in)->_prev_in=e->_prev_in; else

   187 	(e->_head)->_last_in_edge=e->_prev_in;

   188       if (e->_prev_in) (e->_prev_in)->_next_in=e->_next_in; else

   189 	(e->_head)->_first_in_edge=e->_next_in;

   191       delete e;

   192       --_edge_num;

   193     }

   195     void _set_tail(edge_item* e, node_item* _tail) {

   196       if (e->_next_out) (e->_next_out)->_prev_out=e->_prev_out; else

   197 	(e->_tail)->_last_out_edge=e->_prev_out;

   198       if (e->_prev_out) (e->_prev_out)->_next_out=e->_next_out; else

   199 	(e->_tail)->_first_out_edge=e->_next_out;

   201       e->_tail=_tail;

   203       e->_prev_out=_tail->_last_out_edge;

   204       if (_tail->_last_out_edge) (_tail->_last_out_edge)->_next_out=e;

   205       _tail->_last_out_edge=e;

   206       if (!_tail->_first_out_edge) _tail->_first_out_edge=e;

   207       e->_next_out=0;

   208     }

   210     void _set_head(edge_item* e, node_item* _head) {

   211       if (e->_next_in) (e->_next_in)->_prev_in=e->_prev_in; else

   212 	(e->_head)->_last_in_edge=e->_prev_in;

   213       if (e->_prev_in) (e->_prev_in)->_next_in=e->_next_in; else

   214 	(e->_head)->_first_in_edge=e->_next_in;

   216       e->_head=_head;

   218       e->_prev_in=_head->_last_in_edge;

   219       if (_head->_last_in_edge) (_head->_last_in_edge)->_next_in=e;

   220       _head->_last_in_edge=e;

   221       if (!_head->_first_in_edge) { _head->_first_in_edge=e; }

   222       e->_next_in=0;

   223     }

   225   public:

   227     /* default constructor */

   229     ListGraph() : node_id(0), edge_id(0), _node_num(0), _edge_num(0), _first_node(0), _last_node(0) { }

   231     ~ListGraph() {

   232       while (first<EachNodeIt>().valid()) erase(first<EachNodeIt>());

   233     }

   235     int nodeNum() const { return _node_num; }

   236     int edgeNum() const { return _edge_num; }

   238     /* functions to construct iterators from the graph, or from each other */

   240     //EachNodeIt firstNode() const { return EachNodeIt(*this); }

   241     //EachEdgeIt firstEdge() const { return EachEdgeIt(*this); }

   243     //OutEdgeIt firstOutEdge(const NodeIt v) const { return OutEdgeIt(v); }

   244     //InEdgeIt firstInEdge(const NodeIt v) const { return InEdgeIt(v); }

   245     //SymEdgeIt firstSymEdge(const NodeIt v) const { return SymEdgeIt(v); }

   246     NodeIt tail(EdgeIt e) const { return e.tailNode(); }

   247     NodeIt head(EdgeIt e) const { return e.headNode(); }

   249     NodeIt aNode(const OutEdgeIt& e) const { return e.aNode(); }

   250     NodeIt aNode(const InEdgeIt& e) const { return e.aNode(); }

   251     NodeIt aNode(const SymEdgeIt& e) const { return e.aNode(); }

   253     NodeIt bNode(const OutEdgeIt& e) const { return e.bNode(); }

   254     NodeIt bNode(const InEdgeIt& e) const { return e.bNode(); }

   255     NodeIt bNode(const SymEdgeIt& e) const { return e.bNode(); }

   257     //NodeIt invalid_node() { return NodeIt(); }

   258     //EdgeIt invalid_edge() { return EdgeIt(); }

   259     //OutEdgeIt invalid_out_edge() { return OutEdgeIt(); }

   260     //InEdgeIt invalid_in_edge() { return InEdgeIt(); }

   261     //SymEdgeIt invalid_sym_edge() { return SymEdgeIt(); }

   263     /* same methods in other style */

   264     /* for experimental purpose */

   266     EachNodeIt& getFirst(EachNodeIt& v) const {

   267       v=EachNodeIt(*this); return v; }

   268     EachEdgeIt& getFirst(EachEdgeIt& e) const {

   269       e=EachEdgeIt(*this); return e; }

   270     OutEdgeIt& getFirst(OutEdgeIt& e, NodeIt v) const {

   271       e=OutEdgeIt(v); return e; }

   272     InEdgeIt& getFirst(InEdgeIt& e, NodeIt v) const {

   273       e=InEdgeIt(v); return e; }

   274     SymEdgeIt& getFirst(SymEdgeIt& e, NodeIt v) const {

   275       e=SymEdgeIt(v); return e; }

   276     //void getTail(NodeIt& n, const EdgeIt& e) const { n=tail(e); }

   277     //void getHead(NodeIt& n, const EdgeIt& e) const { n=head(e); }

   279     //void getANode(NodeIt& n, const OutEdgeIt& e) const { n=e.aNode(); }

   280     //void getANode(NodeIt& n, const InEdgeIt& e) const { n=e.aNode(); }

   281     //void getANode(NodeIt& n, const SymEdgeIt& e) const { n=e.aNode(); }

   282     //void getBNode(NodeIt& n, const OutEdgeIt& e) const { n=e.bNode(); }

   283     //void getBNode(NodeIt& n, const InEdgeIt& e) const { n=e.bNode(); }

   284     //void getBNode(NodeIt& n, const SymEdgeIt& e) const { n=e.bNode(); }

   285     //void get_invalid(NodeIt& n) { n=NodeIt(); }

   286     //void get_invalid(EdgeIt& e) { e=EdgeIt(); }

   287     //void get_invalid(OutEdgeIt& e) { e=OutEdgeIt(); }

   288     //void get_invalid(InEdgeIt& e) { e=InEdgeIt(); }

   289     //void get_invalid(SymEdgeIt& e) { e=SymEdgeIt(); }

   291     template< typename It >

   292     It first() const {

   293       It e;

   294       getFirst(e);

   295       return e;

   296     }

   298     template< typename It >

   299     It first(NodeIt v) const {

   300       It e;

   301       getFirst(e, v);

   302       return e;

   303     }

   305     /* for getting id's of graph objects */

   306     /* these are important for the implementation of property vectors */

   308     int id(NodeIt v) const { return v.node->id; }

   309     int id(EdgeIt e) const { return e.edge->id; }

   311     /* adding nodes and edges */

   313     NodeIt addNode() { return NodeIt(_add_node()); }

   314     EdgeIt addEdge(NodeIt u, NodeIt v) {

   315       return EdgeIt(_add_edge(u.node, v.node));

   316     }

   318     void erase(NodeIt i) {

   319       while (first<OutEdgeIt>(i).valid()) erase(first<OutEdgeIt>(i));

   320       while (first<InEdgeIt>(i).valid()) erase(first<InEdgeIt>(i));

   321       _delete_node(i.node);

   322     }

   324     void erase(EdgeIt e) { _delete_edge(e.edge); }

   326     void clear() {

   327       while (first<EachNodeIt>().valid()) erase(first<EachNodeIt>());

   328     }

   330     void setTail(EdgeIt e, NodeIt tail) {

   331       _set_tail(e.edge, tail.node);

   332     }

   334     void setHead(EdgeIt e, NodeIt head) {

   335       _set_head(e.edge, head.node);

   336     }

   338     /* stream operations, for testing purpose */

   340     friend std::ostream& operator<<(std::ostream& os, const NodeIt& i) {

   341       os << i.node->id; return os;

   342     }

   343     friend std::ostream& operator<<(std::ostream& os, const EdgeIt& i) {

   344       os << "(" << i.edge->_tail->id << "--" << i.edge->id << "->" << i.edge->_head->id << ")";

   345       return os;

   346     }

   348     class NodeIt {

   349       friend class ListGraph;

   350       template <typename T> friend class NodeMap;

   352       friend class EdgeIt;

   353       friend class OutEdgeIt;

   354       friend class InEdgeIt;

   355       friend class SymEdgeIt;

   356     protected:

   357       node_item* node;

   358       friend int ListGraph::id(NodeIt v) const;

   359     public:

   360       NodeIt() : node(0) { }

   361       NodeIt(node_item* _node) : node(_node) { }

   362       bool valid() const { return (node!=0); }

   363       //void makeInvalid() { node=0; }

   364       friend bool operator==(const NodeIt& u, const NodeIt& v) {

   365 	return v.node==u.node;

   366       }

   367       friend bool operator!=(const NodeIt& u, const NodeIt& v) {

   368 	return v.node!=u.node;

   369       }

   370       friend std::ostream& operator<<(std::ostream& os, const NodeIt& i);

   371     };

   373     class EachNodeIt : public NodeIt {

   374       friend class ListGraph;

   375     protected:

   376       EachNodeIt(const ListGraph& G) : NodeIt(G._first_node) { }

   377     public:

   378       EachNodeIt() : NodeIt() { }

   379       EachNodeIt(node_item* v) : NodeIt(v) { }

   380       EachNodeIt& operator++() { node=node->_next_node; return *this; }

   381     };

   383     class EdgeIt {

   384       friend class ListGraph;

   385       template <typename T> friend class EdgeMap;

   387       friend class NodeIt;

   388       friend class EachNodeIt;

   389     protected:

   390       edge_item* edge;

   391       friend int ListGraph::id(EdgeIt e) const;

   392     public:

   393       EdgeIt() : edge(0) { }

   394       //EdgeIt() { }

   395       EdgeIt(edge_item* _edge) : edge(_edge) { }

   396       bool valid() const { return (edge!=0); }

   397       //void makeInvalid() { edge=0; }

   398       friend bool operator==(const EdgeIt& u, const EdgeIt& v) {

   399 	return v.edge==u.edge;

   400       }

   401       friend bool operator!=(const EdgeIt& u, const EdgeIt& v) {

   402 	return v.edge!=u.edge;

   403       }

   404     protected:

   405       NodeIt tailNode() const { return NodeIt(edge->_tail); }

   406       NodeIt headNode() const { return NodeIt(edge->_head); }

   407     public:

   408       friend std::ostream& operator<<(std::ostream& os, const EdgeIt& i);

   409     };

   411     class EachEdgeIt : public EdgeIt {

   412       friend class ListGraph;

   413     protected:

   414       EachEdgeIt(const ListGraph& G) {

   415 	node_item* v=G._first_node;

   416 	if (v) edge=v->_first_out_edge; else edge=0;

   417 	while (v && !edge) { v=v->_next_node; if (v) edge=v->_first_out_edge; }

   418       }

   419     public:

   420       EachEdgeIt() : EdgeIt() { }

   421       EachEdgeIt(edge_item* _e) : EdgeIt(_e) { }

   422       EachEdgeIt& operator++() {

   423 	node_item* v=edge->_tail;

   424 	edge=edge->_next_out;

   425 	while (v && !edge) { v=v->_next_node; if (v) edge=v->_first_out_edge; }

   426 	return *this;

   427       }

   428     };

   430     class OutEdgeIt : public EdgeIt {

   431       friend class ListGraph;

   432       //node_item* v;

   433     protected:

   434       OutEdgeIt(const NodeIt& _v) /*: v(_v.node)*/ { edge=_v.node->_first_out_edge; }

   435     public:

   436       OutEdgeIt() : EdgeIt()/*, v(0)*/ { }

   437       OutEdgeIt(const ListGraph& G, NodeIt _v) /*: v(_v.node)*/ { edge=_v.node->_first_out_edge; }

   438       OutEdgeIt& operator++() { edge=edge->_next_out; return *this; }

   439     protected:

   440       NodeIt aNode() const { return NodeIt(edge->_tail); }

   441       NodeIt bNode() const { return NodeIt(edge->_head); }

   442     };

   444     class InEdgeIt : public EdgeIt {

   445       friend class ListGraph;

   446       //node_item* v;

   447     protected:

   448       InEdgeIt(const NodeIt& _v) /*: v(_v.node)*/ { edge=_v.node->_first_in_edge; }

   449     public:

   450       InEdgeIt() : EdgeIt()/*, v(0)*/ { }

   451       InEdgeIt(const ListGraph& G, NodeIt _v) /*: v(_v.node)*/ { edge=_v.node->_first_in_edge; }

   452       InEdgeIt& operator++() { edge=edge->_next_in; return *this; }

   453     protected:

   454       NodeIt aNode() const { return NodeIt(edge->_head); }

   455       NodeIt bNode() const { return NodeIt(edge->_tail); }

   456     };

   458     class SymEdgeIt : public EdgeIt {

   459       friend class ListGraph;

   460       bool out_or_in; //1 iff out, 0 iff in

   461       //node_item* v;

   462     protected:

   463       SymEdgeIt(const NodeIt& _v) /*: v(_v.node)*/ {

   464 	out_or_in=1;

   465 	edge=_v.node->_first_out_edge;

   466 	if (!edge) { edge=_v.node->_first_in_edge; out_or_in=0; }

   467       }

   468     public:

   469       SymEdgeIt() : EdgeIt() /*, v(0)*/ { }

   470       SymEdgeIt(const ListGraph& G, NodeIt _v) /*: v(_v.node)*/ {

   471 	out_or_in=1;

   472 	edge=_v.node->_first_out_edge;

   473 	if (!edge) { edge=_v.node->_first_in_edge; out_or_in=0; }

   474       }

   475       SymEdgeIt& operator++() {

   476 	if (out_or_in) {

   477 	  node_item* v=edge->_tail;

   478 	  edge=edge->_next_out;

   479 	  if (!edge) { out_or_in=0; edge=v->_first_in_edge; }

   480 	} else {

   481 	  edge=edge->_next_in;

   482 	}

   483 	return *this;

   484       }

   485     protected:

   486       NodeIt aNode() const {

   487 	return (out_or_in) ? NodeIt(edge->_tail) : NodeIt(edge->_head); }

   488       NodeIt bNode() const {

   489 	return (out_or_in) ? NodeIt(edge->_head) : NodeIt(edge->_tail); }

   490     };

   492   };

   494   /*

   495   template< typename T >

   496   T ListGraph::first() const {

   497     std::cerr << "Invalid use of template<typemane T> T ListGraph::first<T>();" << std::endl;

   498     return T();

   499   }

   501   template<>

   502   ListGraph::EachNodeIt ListGraph::first<ListGraph::EachNodeIt>() const {

   503     return firstNode();

   504   }

   506   template<>

   507   ListGraph::EachEdgeIt ListGraph::first<ListGraph::EachEdgeIt>() const {

   508     return firstEdge();

   509   }

   511   template< typename T >

   512   T ListGraph::first(ListGraph::NodeIt v) const {

   513     std::cerr << "Invalid use of template<typemane T> T ListGraph::first<T>(ListGRaph::NodeIt);" << std::endl;

   514     return T();

   515   }

   517   template<>

   518   ListGraph::OutEdgeIt ListGraph::first<ListGraph::OutEdgeIt>(const ListGraph::NodeIt v) const {

   519     return firstOutEdge(v);

   520   }

   522   template<>

   523   ListGraph::InEdgeIt ListGraph::first<ListGraph::InEdgeIt>(const ListGraph::NodeIt v) const {

   524     return firstInEdge(v);

   525   }

   527   template<>

   528   ListGraph::SymEdgeIt ListGraph::first<ListGraph::SymEdgeIt>(const ListGraph::NodeIt v) const {

   529     return firstSymEdge(v);

   530   }

   531   */

   534 } //namespace marci

   536 #endif //LIST_GRAPH_HH

author	alpar
	Mon, 16 Feb 2004 16:36:12 +0000
changeset 81	6c8adcd6b482
parent 75	87623302a68f
child 86	cbd76005b9a7
permissions	-rw-r--r--