12 for( ; it.valid(); ++it) { ++i; }
30 template <typename T> class NodeMap;
31 template <typename T> class EdgeMap;
35 template <typename T> friend class NodeMap;
36 template <typename T> friend class EdgeMap;
41 std::vector<T> container;
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); }
59 std::vector<T> container;
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); }
79 node_item* _first_node;
80 node_item* _last_node;
83 friend class ListGraph;
84 template <typename T> friend class NodeMap;
87 friend class EachNodeIt;
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);
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;
108 friend class ListGraph;
109 template <typename T> friend class EdgeMap;
112 friend class EachNodeIt;
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);
123 edge_item* _next_out;
124 edge_item* _prev_out;
131 node_item* _add_node() {
132 node_item* p=new node_item;
134 p->_first_out_edge=0;
138 p->_prev_node=_last_node;
140 if (_last_node) _last_node->_next_node=p;
142 if (!_first_node) _first_node=p;
148 edge_item* _add_edge(node_item* _tail, node_item* _head) {
149 edge_item* e=new edge_item;
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;
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; }
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;
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;
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;
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;
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;
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; }
227 /* default constructor */
229 ListGraph() : node_id(0), edge_id(0), _node_num(0), _edge_num(0), _first_node(0), _last_node(0) { }
232 while (first<EachNodeIt>().valid()) erase(first<EachNodeIt>());
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 >
298 template< typename It >
299 It first(NodeIt v) const {
305 bool valid(EdgeIt e) const { return e.valid(); }
306 bool valid(NodeIt n) const { return n.valid(); }
308 template <typename It> It next(It it) const {
309 It tmp(it); return goNext(it); }
310 template <typename It> It& goNext(It& it) const { return ++it; }
313 /* for getting id's of graph objects */
314 /* these are important for the implementation of property vectors */
316 int id(NodeIt v) const { return v.node->id; }
317 int id(EdgeIt e) const { return e.edge->id; }
319 /* adding nodes and edges */
321 NodeIt addNode() { return NodeIt(_add_node()); }
322 EdgeIt addEdge(NodeIt u, NodeIt v) {
323 return EdgeIt(_add_edge(u.node, v.node));
326 void erase(NodeIt i) {
327 while (first<OutEdgeIt>(i).valid()) erase(first<OutEdgeIt>(i));
328 while (first<InEdgeIt>(i).valid()) erase(first<InEdgeIt>(i));
329 _delete_node(i.node);
332 void erase(EdgeIt e) { _delete_edge(e.edge); }
335 while (first<EachNodeIt>().valid()) erase(first<EachNodeIt>());
338 void setTail(EdgeIt e, NodeIt tail) {
339 _set_tail(e.edge, tail.node);
342 void setHead(EdgeIt e, NodeIt head) {
343 _set_head(e.edge, head.node);
346 /* stream operations, for testing purpose */
348 friend std::ostream& operator<<(std::ostream& os, const NodeIt& i) {
349 os << i.node->id; return os;
351 friend std::ostream& operator<<(std::ostream& os, const EdgeIt& i) {
352 os << "(" << i.edge->_tail->id << "--" << i.edge->id << "->" << i.edge->_head->id << ")";
357 friend class ListGraph;
358 template <typename T> friend class NodeMap;
361 friend class OutEdgeIt;
362 friend class InEdgeIt;
363 friend class SymEdgeIt;
366 friend int ListGraph::id(NodeIt v) const;
368 NodeIt() : node(0) { }
369 NodeIt(node_item* _node) : node(_node) { }
370 bool valid() const { return (node!=0); }
371 //void makeInvalid() { node=0; }
372 friend bool operator==(const NodeIt& u, const NodeIt& v) {
373 return v.node==u.node;
375 friend bool operator!=(const NodeIt& u, const NodeIt& v) {
376 return v.node!=u.node;
378 friend std::ostream& operator<<(std::ostream& os, const NodeIt& i);
381 class EachNodeIt : public NodeIt {
382 friend class ListGraph;
384 EachNodeIt(const ListGraph& G) : NodeIt(G._first_node) { }
386 EachNodeIt() : NodeIt() { }
387 EachNodeIt(node_item* v) : NodeIt(v) { }
388 EachNodeIt& operator++() { node=node->_next_node; return *this; }
392 friend class ListGraph;
393 template <typename T> friend class EdgeMap;
396 friend class EachNodeIt;
399 friend int ListGraph::id(EdgeIt e) const;
401 EdgeIt() : edge(0) { }
403 EdgeIt(edge_item* _edge) : edge(_edge) { }
404 bool valid() const { return (edge!=0); }
405 //void makeInvalid() { edge=0; }
406 friend bool operator==(const EdgeIt& u, const EdgeIt& v) {
407 return v.edge==u.edge;
409 friend bool operator!=(const EdgeIt& u, const EdgeIt& v) {
410 return v.edge!=u.edge;
413 NodeIt tailNode() const { return NodeIt(edge->_tail); }
414 NodeIt headNode() const { return NodeIt(edge->_head); }
416 friend std::ostream& operator<<(std::ostream& os, const EdgeIt& i);
419 class EachEdgeIt : public EdgeIt {
420 friend class ListGraph;
422 EachEdgeIt(const ListGraph& G) {
423 node_item* v=G._first_node;
424 if (v) edge=v->_first_out_edge; else edge=0;
425 while (v && !edge) { v=v->_next_node; if (v) edge=v->_first_out_edge; }
428 EachEdgeIt() : EdgeIt() { }
429 EachEdgeIt(edge_item* _e) : EdgeIt(_e) { }
430 EachEdgeIt& operator++() {
431 node_item* v=edge->_tail;
432 edge=edge->_next_out;
433 while (v && !edge) { v=v->_next_node; if (v) edge=v->_first_out_edge; }
438 class OutEdgeIt : public EdgeIt {
439 friend class ListGraph;
442 OutEdgeIt(const NodeIt& _v) /*: v(_v.node)*/ { edge=_v.node->_first_out_edge; }
444 OutEdgeIt() : EdgeIt()/*, v(0)*/ { }
445 OutEdgeIt(const ListGraph& G, NodeIt _v) /*: v(_v.node)*/ { edge=_v.node->_first_out_edge; }
446 OutEdgeIt& operator++() { edge=edge->_next_out; return *this; }
448 NodeIt aNode() const { return NodeIt(edge->_tail); }
449 NodeIt bNode() const { return NodeIt(edge->_head); }
452 class InEdgeIt : public EdgeIt {
453 friend class ListGraph;
456 InEdgeIt(const NodeIt& _v) /*: v(_v.node)*/ { edge=_v.node->_first_in_edge; }
458 InEdgeIt() : EdgeIt()/*, v(0)*/ { }
459 InEdgeIt(const ListGraph& G, NodeIt _v) /*: v(_v.node)*/ { edge=_v.node->_first_in_edge; }
460 InEdgeIt& operator++() { edge=edge->_next_in; return *this; }
462 NodeIt aNode() const { return NodeIt(edge->_head); }
463 NodeIt bNode() const { return NodeIt(edge->_tail); }
466 class SymEdgeIt : public EdgeIt {
467 friend class ListGraph;
468 bool out_or_in; //1 iff out, 0 iff in
471 SymEdgeIt(const NodeIt& _v) /*: v(_v.node)*/ {
473 edge=_v.node->_first_out_edge;
474 if (!edge) { edge=_v.node->_first_in_edge; out_or_in=0; }
477 SymEdgeIt() : EdgeIt() /*, v(0)*/ { }
478 SymEdgeIt(const ListGraph& G, NodeIt _v) /*: v(_v.node)*/ {
480 edge=_v.node->_first_out_edge;
481 if (!edge) { edge=_v.node->_first_in_edge; out_or_in=0; }
483 SymEdgeIt& operator++() {
485 node_item* v=edge->_tail;
486 edge=edge->_next_out;
487 if (!edge) { out_or_in=0; edge=v->_first_in_edge; }
494 NodeIt aNode() const {
495 return (out_or_in) ? NodeIt(edge->_tail) : NodeIt(edge->_head); }
496 NodeIt bNode() const {
497 return (out_or_in) ? NodeIt(edge->_head) : NodeIt(edge->_tail); }
503 template< typename T >
504 T ListGraph::first() const {
505 std::cerr << "Invalid use of template<typemane T> T ListGraph::first<T>();" << std::endl;
510 ListGraph::EachNodeIt ListGraph::first<ListGraph::EachNodeIt>() const {
515 ListGraph::EachEdgeIt ListGraph::first<ListGraph::EachEdgeIt>() const {
519 template< typename T >
520 T ListGraph::first(ListGraph::NodeIt v) const {
521 std::cerr << "Invalid use of template<typemane T> T ListGraph::first<T>(ListGRaph::NodeIt);" << std::endl;
526 ListGraph::OutEdgeIt ListGraph::first<ListGraph::OutEdgeIt>(const ListGraph::NodeIt v) const {
527 return firstOutEdge(v);
531 ListGraph::InEdgeIt ListGraph::first<ListGraph::InEdgeIt>(const ListGraph::NodeIt v) const {
532 return firstInEdge(v);
536 ListGraph::SymEdgeIt ListGraph::first<ListGraph::SymEdgeIt>(const ListGraph::NodeIt v) const {
537 return firstSymEdge(v);
544 #endif //LIST_GRAPH_HH