1.1 --- a/src/work/deba/test_graph.h Tue Jul 06 13:57:01 2004 +0000
1.2 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000
1.3 @@ -1,539 +0,0 @@
1.4 -// -*- c++ -*-
1.5 -#ifndef HUGO_LIST_GRAPH_H
1.6 -#define HUGO_LIST_GRAPH_H
1.7 -
1.8 -#include <iostream>
1.9 -#include <vector>
1.10 -
1.11 -#include "invalid.h"
1.12 -
1.13 -#include "map_registry.h"
1.14 -#include "array_map_factory.h"
1.15 -
1.16 -#include "map_defines.h"
1.17 -
1.18 -namespace hugo {
1.19 -
1.20 - template <typename It>
1.21 - int count(It it) {
1.22 - int i=0;
1.23 - for( ; it.valid(); ++it) { ++i; }
1.24 - return i;
1.25 - }
1.26 -
1.27 - class ListGraph {
1.28 - class node_item;
1.29 - class edge_item;
1.30 - public:
1.31 - class Node;
1.32 - class NodeIt;
1.33 - class Edge;
1.34 - class EdgeIt;
1.35 - class OutEdgeIt;
1.36 - class InEdgeIt;
1.37 - class SymEdgeIt;
1.38 -
1.39 - typedef ListGraph Graph;
1.40 -
1.41 - CREATE_MAP_REGISTRIES;
1.42 - CREATE_MAPS(ArrayMapFactory);
1.43 -
1.44 - private:
1.45 -
1.46 - int node_id;
1.47 - int edge_id;
1.48 - int _node_num;
1.49 - int _edge_num;
1.50 -
1.51 - node_item* _first_node;
1.52 - node_item* _last_node;
1.53 -
1.54 - class node_item {
1.55 - friend class ListGraph;
1.56 - template <typename T> friend class NodeMap;
1.57 -
1.58 - friend class Node;
1.59 - friend class NodeIt;
1.60 - friend class Edge;
1.61 - friend class EdgeIt;
1.62 - friend class OutEdgeIt;
1.63 - friend class InEdgeIt;
1.64 - friend class SymEdgeIt;
1.65 - friend std::ostream& operator<<(std::ostream& os, const Node& i);
1.66 - friend std::ostream& operator<<(std::ostream& os, const Edge& i);
1.67 - //ListGraph* G;
1.68 - int id;
1.69 - edge_item* _first_out_edge;
1.70 - edge_item* _last_out_edge;
1.71 - edge_item* _first_in_edge;
1.72 - edge_item* _last_in_edge;
1.73 - node_item* _next_node;
1.74 - node_item* _prev_node;
1.75 - public:
1.76 - node_item() { }
1.77 - };
1.78 -
1.79 - class edge_item {
1.80 - friend class ListGraph;
1.81 - template <typename T> friend class EdgeMap;
1.82 -
1.83 - friend class Node;
1.84 - friend class NodeIt;
1.85 - friend class Edge;
1.86 - friend class EdgeIt;
1.87 - friend class OutEdgeIt;
1.88 - friend class InEdgeIt;
1.89 - friend class SymEdgeIt;
1.90 - friend std::ostream& operator<<(std::ostream& os, const Edge& i);
1.91 - //ListGraph* G;
1.92 - int id;
1.93 - node_item* _tail;
1.94 - node_item* _head;
1.95 - edge_item* _next_out;
1.96 - edge_item* _prev_out;
1.97 - edge_item* _next_in;
1.98 - edge_item* _prev_in;
1.99 - public:
1.100 - edge_item() { }
1.101 - };
1.102 -
1.103 - node_item* _add_node() {
1.104 - node_item* p=new node_item;
1.105 - p->id=node_id++;
1.106 - p->_first_out_edge=0;
1.107 - p->_last_out_edge=0;
1.108 - p->_first_in_edge=0;
1.109 - p->_last_in_edge=0;
1.110 - p->_prev_node=_last_node;
1.111 - p->_next_node=0;
1.112 - if (_last_node) _last_node->_next_node=p;
1.113 - _last_node=p;
1.114 - if (!_first_node) _first_node=p;
1.115 -
1.116 - ++_node_num;
1.117 - return p;
1.118 - }
1.119 -
1.120 - edge_item* _add_edge(node_item* _tail, node_item* _head) {
1.121 - edge_item* e=new edge_item;
1.122 - e->id=edge_id++;
1.123 - e->_tail=_tail;
1.124 - e->_head=_head;
1.125 -
1.126 - e->_prev_out=_tail->_last_out_edge;
1.127 - if (_tail->_last_out_edge) (_tail->_last_out_edge)->_next_out=e;
1.128 - _tail->_last_out_edge=e;
1.129 - if (!_tail->_first_out_edge) _tail->_first_out_edge=e;
1.130 - e->_next_out=0;
1.131 -
1.132 - e->_prev_in=_head->_last_in_edge;
1.133 - if (_head->_last_in_edge) (_head->_last_in_edge)->_next_in=e;
1.134 - _head->_last_in_edge=e;
1.135 - if (!_head->_first_in_edge) { _head->_first_in_edge=e; }
1.136 - e->_next_in=0;
1.137 -
1.138 - ++_edge_num;
1.139 - return e;
1.140 - }
1.141 -
1.142 - //deletes a node which has no out edge and no in edge
1.143 - void _delete_node(node_item* v) {
1.144 - if (v->_next_node) (v->_next_node)->_prev_node=v->_prev_node; else
1.145 - _last_node=v->_prev_node;
1.146 - if (v->_prev_node) (v->_prev_node)->_next_node=v->_next_node; else
1.147 - _first_node=v->_next_node;
1.148 -
1.149 - delete v;
1.150 - --_node_num;
1.151 - }
1.152 -
1.153 - void _delete_edge(edge_item* e) {
1.154 - if (e->_next_out) (e->_next_out)->_prev_out=e->_prev_out; else
1.155 - (e->_tail)->_last_out_edge=e->_prev_out;
1.156 - if (e->_prev_out) (e->_prev_out)->_next_out=e->_next_out; else
1.157 - (e->_tail)->_first_out_edge=e->_next_out;
1.158 - if (e->_next_in) (e->_next_in)->_prev_in=e->_prev_in; else
1.159 - (e->_head)->_last_in_edge=e->_prev_in;
1.160 - if (e->_prev_in) (e->_prev_in)->_next_in=e->_next_in; else
1.161 - (e->_head)->_first_in_edge=e->_next_in;
1.162 -
1.163 - delete e;
1.164 - --_edge_num;
1.165 - }
1.166 -
1.167 - void _set_tail(edge_item* e, node_item* _tail) {
1.168 - if (e->_next_out) (e->_next_out)->_prev_out=e->_prev_out; else
1.169 - (e->_tail)->_last_out_edge=e->_prev_out;
1.170 - if (e->_prev_out) (e->_prev_out)->_next_out=e->_next_out; else
1.171 - (e->_tail)->_first_out_edge=e->_next_out;
1.172 -
1.173 - e->_tail=_tail;
1.174 -
1.175 - e->_prev_out=_tail->_last_out_edge;
1.176 - if (_tail->_last_out_edge) (_tail->_last_out_edge)->_next_out=e;
1.177 - _tail->_last_out_edge=e;
1.178 - if (!_tail->_first_out_edge) _tail->_first_out_edge=e;
1.179 - e->_next_out=0;
1.180 - }
1.181 -
1.182 - void _set_head(edge_item* e, node_item* _head) {
1.183 - if (e->_next_in) (e->_next_in)->_prev_in=e->_prev_in; else
1.184 - (e->_head)->_last_in_edge=e->_prev_in;
1.185 - if (e->_prev_in) (e->_prev_in)->_next_in=e->_next_in; else
1.186 - (e->_head)->_first_in_edge=e->_next_in;
1.187 -
1.188 - e->_head=_head;
1.189 -
1.190 - e->_prev_in=_head->_last_in_edge;
1.191 - if (_head->_last_in_edge) (_head->_last_in_edge)->_next_in=e;
1.192 - _head->_last_in_edge=e;
1.193 - if (!_head->_first_in_edge) { _head->_first_in_edge=e; }
1.194 - e->_next_in=0;
1.195 - }
1.196 -
1.197 - public:
1.198 -
1.199 - /* default constructor */
1.200 -
1.201 - ListGraph() : node_id(0), edge_id(0), _node_num(0), _edge_num(0), _first_node(0), _last_node(0){ }
1.202 -
1.203 - ~ListGraph() {
1.204 - while (first<NodeIt>().valid()) erase(first<NodeIt>());
1.205 - }
1.206 -
1.207 - int nodeNum() const { return _node_num; }
1.208 - int edgeNum() const { return _edge_num; }
1.209 -
1.210 - /* functions to construct iterators from the graph, or from each other */
1.211 -
1.212 - //NodeIt firstNode() const { return NodeIt(*this); }
1.213 - //EdgeIt firstEdge() const { return EdgeIt(*this); }
1.214 -
1.215 - //OutEdgeIt firstOutEdge(const Node v) const { return OutEdgeIt(v); }
1.216 - //InEdgeIt firstInEdge(const Node v) const { return InEdgeIt(v); }
1.217 - //SymEdgeIt firstSymEdge(const Node v) const { return SymEdgeIt(v); }
1.218 - Node tail(Edge e) const { return e.tailNode(); }
1.219 - Node head(Edge e) const { return e.headNode(); }
1.220 -
1.221 - Node aNode(const OutEdgeIt& e) const { return e.aNode(); }
1.222 - Node aNode(const InEdgeIt& e) const { return e.aNode(); }
1.223 - Node aNode(const SymEdgeIt& e) const { return e.aNode(); }
1.224 -
1.225 - Node bNode(const OutEdgeIt& e) const { return e.bNode(); }
1.226 - Node bNode(const InEdgeIt& e) const { return e.bNode(); }
1.227 - Node bNode(const SymEdgeIt& e) const { return e.bNode(); }
1.228 -
1.229 - //Node invalid_node() { return Node(); }
1.230 - //Edge invalid_edge() { return Edge(); }
1.231 - //OutEdgeIt invalid_out_edge() { return OutEdgeIt(); }
1.232 - //InEdgeIt invalid_in_edge() { return InEdgeIt(); }
1.233 - //SymEdgeIt invalid_sym_edge() { return SymEdgeIt(); }
1.234 -
1.235 - /* same methods in other style */
1.236 - /* for experimental purpose */
1.237 -
1.238 - NodeIt& /*getF*/first(NodeIt& v) const {
1.239 - v=NodeIt(*this); return v; }
1.240 - EdgeIt& /*getF*/first(EdgeIt& e) const {
1.241 - e=EdgeIt(*this); return e; }
1.242 - OutEdgeIt& /*getF*/first(OutEdgeIt& e, Node v) const {
1.243 - e=OutEdgeIt(*this, v); return e; }
1.244 - InEdgeIt& /*getF*/first(InEdgeIt& e, Node v) const {
1.245 - e=InEdgeIt(*this, v); return e; }
1.246 - SymEdgeIt& /*getF*/first(SymEdgeIt& e, Node v) const {
1.247 - e=SymEdgeIt(*this, v); return e; }
1.248 - //void getTail(Node& n, const Edge& e) const { n=tail(e); }
1.249 - //void getHead(Node& n, const Edge& e) const { n=head(e); }
1.250 -
1.251 - //void getANode(Node& n, const OutEdgeIt& e) const { n=e.aNode(); }
1.252 - //void getANode(Node& n, const InEdgeIt& e) const { n=e.aNode(); }
1.253 - //void getANode(Node& n, const SymEdgeIt& e) const { n=e.aNode(); }
1.254 - //void getBNode(Node& n, const OutEdgeIt& e) const { n=e.bNode(); }
1.255 - //void getBNode(Node& n, const InEdgeIt& e) const { n=e.bNode(); }
1.256 - //void getBNode(Node& n, const SymEdgeIt& e) const { n=e.bNode(); }
1.257 - //void get_invalid(Node& n) { n=Node(); }
1.258 - //void get_invalid(Edge& e) { e=Edge(); }
1.259 - //void get_invalid(OutEdgeIt& e) { e=OutEdgeIt(); }
1.260 - //void get_invalid(InEdgeIt& e) { e=InEdgeIt(); }
1.261 - //void get_invalid(SymEdgeIt& e) { e=SymEdgeIt(); }
1.262 -
1.263 - template< typename It >
1.264 - It first() const {
1.265 - It e;
1.266 - /*getF*/first(e);
1.267 - return e;
1.268 - }
1.269 -
1.270 - template< typename It >
1.271 - It first(Node v) const {
1.272 - It e;
1.273 - /*getF*/first(e, v);
1.274 - return e;
1.275 - }
1.276 -
1.277 - bool valid(Node n) const { return n.valid(); }
1.278 - bool valid(Edge e) const { return e.valid(); }
1.279 -
1.280 - template <typename It> It getNext(It it) const {
1.281 - It tmp(it); return next(tmp); }
1.282 - template <typename It> It& next(It& it) const { return ++it; }
1.283 -
1.284 -
1.285 - /* for getting id's of graph objects */
1.286 - /* these are important for the implementation of property vectors */
1.287 -
1.288 - int id(Node v) const { return v.node->id; }
1.289 - int id(Edge e) const { return e.edge->id; }
1.290 -
1.291 - /* adding nodes and edges */
1.292 -
1.293 - Node addNode() {
1.294 - Node n = _add_node();
1.295 - node_maps.add(n);
1.296 - return n;
1.297 - }
1.298 - Edge addEdge(Node u, Node v) {
1.299 - Edge e = _add_edge(u.node, v.node);
1.300 - edge_maps.add(e);
1.301 - return e;
1.302 - }
1.303 -
1.304 - void erase(Node i) {
1.305 - node_maps.erase(i);
1.306 - while (first<OutEdgeIt>(i).valid()) erase(first<OutEdgeIt>(i));
1.307 - while (first<InEdgeIt>(i).valid()) erase(first<InEdgeIt>(i));
1.308 - _delete_node(i.node);
1.309 - }
1.310 -
1.311 - void erase(Edge e) {
1.312 - edge_maps.erase(e);
1.313 - _delete_edge(e.edge);
1.314 - }
1.315 -
1.316 - void clear() {
1.317 - while (first<NodeIt>().valid()) erase(first<NodeIt>());
1.318 - }
1.319 -
1.320 - void setTail(Edge e, Node tail) {
1.321 - _set_tail(e.edge, tail.node);
1.322 - }
1.323 -
1.324 - void setHead(Edge e, Node head) {
1.325 - _set_head(e.edge, head.node);
1.326 - }
1.327 -
1.328 - /* stream operations, for testing purpose */
1.329 -
1.330 - friend std::ostream& operator<<(std::ostream& os, const Node& i) {
1.331 - os << i.node->id; return os;
1.332 - }
1.333 - friend std::ostream& operator<<(std::ostream& os, const Edge& i) {
1.334 - os << "(" << i.edge->_tail->id << "--" << i.edge->id << "->" << i.edge->_head->id << ")";
1.335 - return os;
1.336 - }
1.337 -
1.338 - class Node {
1.339 - friend class ListGraph;
1.340 - template <typename T> friend class NodeMap;
1.341 -
1.342 - friend class Edge;
1.343 - friend class OutEdgeIt;
1.344 - friend class InEdgeIt;
1.345 - friend class SymEdgeIt;
1.346 - //public: //FIXME: It is required by op= of NodeIt
1.347 - protected:
1.348 - node_item* node;
1.349 - protected:
1.350 - friend int ListGraph::id(Node v) const;
1.351 - public:
1.352 - Node() /*: node(0)*/ { }
1.353 - Node(const Invalid&) : node(0) { }
1.354 - protected:
1.355 - Node(node_item* _node) : node(_node) { }
1.356 - bool valid() const { return (node); }
1.357 - public:
1.358 - //void makeInvalid() { node=0; }
1.359 - friend bool operator==(Node u, Node v) { return v.node==u.node; }
1.360 - friend bool operator!=(Node u, Node v) { return v.node!=u.node; }
1.361 - friend std::ostream& operator<<(std::ostream& os, const Node& i);
1.362 - };
1.363 -
1.364 - class NodeIt : public Node {
1.365 - friend class ListGraph;
1.366 - //protected:
1.367 - public: //for everybody but marci
1.368 - NodeIt(const ListGraph& G) : Node(G._first_node) { }
1.369 - public:
1.370 - NodeIt() : Node() { }
1.371 - NodeIt(const Invalid& i) : Node(i) { }
1.372 - protected:
1.373 - NodeIt(node_item* v) : Node(v) { }
1.374 - NodeIt& operator++() { node=node->_next_node; return *this; }
1.375 - //FIXME::
1.376 - // NodeIt& operator=(const Node& e)
1.377 - // { node=e.node; return *this; }
1.378 - };
1.379 -
1.380 - class Edge {
1.381 - friend class ListGraph;
1.382 - template <typename T> friend class EdgeMap;
1.383 -
1.384 - friend class Node;
1.385 - friend class NodeIt;
1.386 - protected:
1.387 - edge_item* edge;
1.388 - friend int ListGraph::id(Edge e) const;
1.389 - public:
1.390 - Edge() /*: edge(0)*/ { }
1.391 - Edge(const Invalid&) : edge(0) { }
1.392 - //Edge() { }
1.393 - protected:
1.394 - Edge(edge_item* _edge) : edge(_edge) { }
1.395 - bool valid() const { return (edge); }
1.396 - public:
1.397 - //void makeInvalid() { edge=0; }
1.398 - friend bool operator==(Edge u, Edge v) { return v.edge==u.edge; }
1.399 - friend bool operator!=(Edge u, Edge v) { return v.edge!=u.edge; }
1.400 - protected:
1.401 - Node tailNode() const { return Node(edge->_tail); }
1.402 - Node headNode() const { return Node(edge->_head); }
1.403 - public:
1.404 - friend std::ostream& operator<<(std::ostream& os, const Edge& i);
1.405 - };
1.406 -
1.407 - class EdgeIt : public Edge {
1.408 - friend class ListGraph;
1.409 - //protected:
1.410 - public: //for alpar
1.411 - EdgeIt(const ListGraph& G) {
1.412 - node_item* v=G._first_node;
1.413 - if (v) edge=v->_first_out_edge; else edge=0;
1.414 - while (v && !edge) { v=v->_next_node; if (v) edge=v->_first_out_edge; }
1.415 - }
1.416 - public:
1.417 - EdgeIt() : Edge() { }
1.418 - EdgeIt(const Invalid& i) : Edge(i) { }
1.419 - protected:
1.420 - EdgeIt(edge_item* _e) : Edge(_e) { }
1.421 - EdgeIt& operator++() {
1.422 - node_item* v=edge->_tail;
1.423 - edge=edge->_next_out;
1.424 - while (v && !edge) { v=v->_next_node; if (v) edge=v->_first_out_edge; }
1.425 - return *this;
1.426 - }
1.427 - };
1.428 -
1.429 - class OutEdgeIt : public Edge {
1.430 - friend class ListGraph;
1.431 - //node_item* v;
1.432 - //protected:
1.433 - protected: //for alpar
1.434 - OutEdgeIt(const Node& _v) /*: v(_v.node)*/ { edge=_v.node->_first_out_edge; }
1.435 - public:
1.436 - OutEdgeIt() : Edge()/*, v(0)*/ { }
1.437 - OutEdgeIt(const Invalid& i) : Edge(i) { }
1.438 - OutEdgeIt(const ListGraph&, Node _v) /*: v(_v.node)*/ { edge=_v.node->_first_out_edge; }
1.439 - protected:
1.440 - OutEdgeIt& operator++() { edge=edge->_next_out; return *this; }
1.441 - protected:
1.442 - Node aNode() const { return Node(edge->_tail); }
1.443 - Node bNode() const { return Node(edge->_head); }
1.444 - };
1.445 -
1.446 - class InEdgeIt : public Edge {
1.447 - friend class ListGraph;
1.448 - //node_item* v;
1.449 - //protected:
1.450 - protected: //for alpar
1.451 - InEdgeIt(const Node& _v) /*: v(_v.node)*/ { edge=_v.node->_first_in_edge; }
1.452 - public:
1.453 - InEdgeIt() : Edge()/*, v(0)*/ { }
1.454 - InEdgeIt(const Invalid& i) : Edge(i) { }
1.455 - InEdgeIt(const ListGraph&, Node _v) /*: v(_v.node)*/ { edge=_v.node->_first_in_edge; }
1.456 - protected:
1.457 - InEdgeIt& operator++() { edge=edge->_next_in; return *this; }
1.458 - protected:
1.459 - Node aNode() const { return Node(edge->_head); }
1.460 - Node bNode() const { return Node(edge->_tail); }
1.461 - };
1.462 -
1.463 - class SymEdgeIt : public Edge {
1.464 - friend class ListGraph;
1.465 - bool out_or_in; //1 iff out, 0 iff in
1.466 - //node_item* v;
1.467 - //protected:
1.468 - public: //for alpar
1.469 - SymEdgeIt(const Node& _v) /*: v(_v.node)*/ {
1.470 - out_or_in=1;
1.471 - edge=_v.node->_first_out_edge;
1.472 - if (!edge) { edge=_v.node->_first_in_edge; out_or_in=0; }
1.473 - }
1.474 - public:
1.475 - SymEdgeIt() : Edge() /*, v(0)*/ { }
1.476 - SymEdgeIt(const Invalid& i) : Edge(i) { }
1.477 - SymEdgeIt(const ListGraph&, Node _v) /*: v(_v.node)*/ {
1.478 - out_or_in=1;
1.479 - edge=_v.node->_first_out_edge;
1.480 - if (!edge) { edge=_v.node->_first_in_edge; out_or_in=0; }
1.481 - }
1.482 - protected:
1.483 - SymEdgeIt& operator++() {
1.484 - if (out_or_in) {
1.485 - node_item* v=edge->_tail;
1.486 - edge=edge->_next_out;
1.487 - if (!edge) { out_or_in=0; edge=v->_first_in_edge; }
1.488 - } else {
1.489 - edge=edge->_next_in;
1.490 - }
1.491 - return *this;
1.492 - }
1.493 - protected:
1.494 - Node aNode() const {
1.495 - return (out_or_in) ? Node(edge->_tail) : Node(edge->_head); }
1.496 - Node bNode() const {
1.497 - return (out_or_in) ? Node(edge->_head) : Node(edge->_tail); }
1.498 - };
1.499 -
1.500 - };
1.501 -
1.502 - // template< typename T >
1.503 - // T ListGraph::first() const {
1.504 - // std::cerr << "Invalid use of template<typemane T> T ListGraph::first<T>();" << std::endl;
1.505 - // return T();
1.506 - // }
1.507 -
1.508 - // template<>
1.509 - // ListGraph::NodeIt ListGraph::first<ListGraph::NodeIt>() const {
1.510 - // return firstNode();
1.511 - // }
1.512 -
1.513 - // template<>
1.514 - // ListGraph::EdgeIt ListGraph::first<ListGraph::EdgeIt>() const {
1.515 - // return firstEdge();
1.516 - // }
1.517 -
1.518 - // template< typename T >
1.519 - // T ListGraph::first(ListGraph::Node v) const {
1.520 - // std::cerr << "Invalid use of template<typemane T> T ListGraph::first<T>(ListGRaph::Node);" << std::endl;
1.521 - // return T();
1.522 - // }
1.523 -
1.524 - // template<>
1.525 - // ListGraph::OutEdgeIt ListGraph::first<ListGraph::OutEdgeIt>(const ListGraph::Node v) const {
1.526 - // return firstOutEdge(v);
1.527 - // }
1.528 -
1.529 - // template<>
1.530 - // ListGraph::InEdgeIt ListGraph::first<ListGraph::InEdgeIt>(const ListGraph::Node v) const {
1.531 - // return firstInEdge(v);
1.532 - // }
1.533 -
1.534 - // template<>
1.535 - // ListGraph::SymEdgeIt ListGraph::first<ListGraph::SymEdgeIt>(const ListGraph::Node v) const {
1.536 - // return firstSymEdge(v);
1.537 - // }
1.538 -
1.539 -
1.540 -} //namespace hugo
1.541 -
1.542 -#endif //HUGO_LIST_GRAPH_H