COIN-OR::LEMON - Graph Library

source: lemon-0.x/src/lemon/iterable_graph_extender.h @ 1020:f42cb3146ed4

Last change on this file since 1020:f42cb3146ed4 was 962:1a770e9f80b2, checked in by Mihaly Barasz, 16 years ago

Undirect graph implementation.
Not yet done, untested.

File size: 3.2 KB
RevLine 
[946]1// -*- c++ -*-
2#ifndef LEMON_ITERABLE_GRAPH_EXTENDER_H
3#define LEMON_ITERABLE_GRAPH_EXTENDER_H
4
5#include <lemon/invalid.h>
6
7namespace lemon {
8 
9  template <typename _Base>
10  class IterableGraphExtender : public _Base {
[962]11  public:
[946]12
13    typedef _Base Parent;
14    typedef IterableGraphExtender<_Base> Graph;
15
16    typedef typename Parent::Node Node;
17    typedef typename Parent::Edge Edge;
18
19
20    class NodeIt : public Node {
21      const Graph* graph;
22    public:
23
24      NodeIt() {}
25
26      NodeIt(Invalid i) : Node(i) { }
27
[962]28      explicit NodeIt(const Graph& _graph) : graph(&_graph) {
[946]29        _graph.first(*static_cast<Node*>(this));
30      }
31
32      NodeIt(const Graph& _graph, const Node& node)
33        : Node(node), graph(&_graph) {}
34
35      NodeIt& operator++() {
36        graph->next(*this);
37        return *this;
38      }
39
40    };
41
42
43    class EdgeIt : public Edge {
44      const Graph* graph;
45    public:
46
47      EdgeIt() { }
48
49      EdgeIt(Invalid i) : Edge(i) { }
50
[962]51      explicit EdgeIt(const Graph& _graph) : graph(&_graph) {
[946]52        _graph.first(*static_cast<Edge*>(this));
53      }
54
55      EdgeIt(const Graph& _graph, const Edge& e) :
56        Edge(e), graph(&_graph) { }
57
58      EdgeIt& operator++() {
59        graph->next(*this);
60        return *this;
61      }
62
63    };
64
65
66    class OutEdgeIt : public Edge {
67      const Graph* graph;
68    public:
69
70      OutEdgeIt() { }
71
72      OutEdgeIt(Invalid i) : Edge(i) { }
73
74      OutEdgeIt(const Graph& _graph, const Node& node)
[962]75        : graph(&_graph) {
[946]76        _graph.firstOut(*this, node);
77      }
78
79      OutEdgeIt(const Graph& _graph, const Edge& edge)
80        : Edge(edge), graph(&_graph) {}
81
82      OutEdgeIt& operator++() {
83        graph->nextOut(*this);
84        return *this;
85      }
86
87    };
88
89
90    class InEdgeIt : public Edge {
91      const Graph* graph;
92    public:
93
94      InEdgeIt() { }
95
96      InEdgeIt(Invalid i) : Edge(i) { }
97
98      InEdgeIt(const Graph& _graph, const Node& node)
[962]99        : graph(&_graph) {
[946]100        _graph.firstIn(*this, node);
101      }
102
103      InEdgeIt(const Graph& _graph, const Edge& edge) :
104        Edge(edge), graph(&_graph) {}
105
106      InEdgeIt& operator++() {
107        graph->nextIn(*this);
108        return *this;
109      }
110
111    };
112
113    using Parent::first;
114
115  private:
116
117    /// \todo When (and if) we change the iterators concept to use operator*,
118    /// then the following shadowed methods will become superfluous.
119    /// But for now these are important safety measures.
120
121    void first(NodeIt &) const;
122    void first(EdgeIt &) const;
123    void first(OutEdgeIt &) const;
124    void first(InEdgeIt &) const;
125
126  };
127 
[962]128  template <typename _Base>
129  class IterableUndirGraphExtender : public IterableGraphExtender<_Base> {
130  public:
131
132    typedef IterableGraphExtender<_Base> Parent;
133    typedef IterableUndirGraphExtender<_Base> Graph;
134
135    typedef typename Parent::UndirEdge UndirEdge;
136
137    class UndirEdgeIt : public UndirEdge {
138      const Graph* graph;
139    public:
140
141      UndirEdgeIt() { }
142
143      UndirEdgeIt(Invalid i) : UndirEdge(i) { }
144
145      explicit UndirEdgeIt(const Graph& _graph) : graph(&_graph) {
146        _graph.first(*static_cast<UndirEdge*>(this));
147      }
148
149      UndirEdgeIt(const Graph& _graph, const UndirEdge& e) :
150        UndirEdge(e), graph(&_graph) { }
151
152      UndirEdgeIt& operator++() {
153        graph->next(*this);
154        return *this;
155      }
156
157    };
158
159
160  };
[946]161}
162
163#endif // LEMON_GRAPH_EXTENDER_H
Note: See TracBrowser for help on using the repository browser.