Changeset 1030:c8a41699e613 in lemon0.x for src/lemon/iterable_graph_extender.h
 Timestamp:
 12/06/04 01:30:44 (20 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@1420
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

src/lemon/iterable_graph_extender.h
r1022 r1030 158 158 }; 159 159 160 class UndirIncEdgeIt : public UndirEdge {160 class IncEdgeIt : public UndirEdge { 161 161 const Graph* graph; 162 162 bool forward; … … 166 166 public: 167 167 168 UndirIncEdgeIt() { }169 170 UndirIncEdgeIt(Invalid i) : UndirEdge(i), forward(false) { }171 172 explicit UndirIncEdgeIt(const Graph& _graph, const Node &n)168 IncEdgeIt() { } 169 170 IncEdgeIt(Invalid i) : UndirEdge(i), forward(false) { } 171 172 explicit IncEdgeIt(const Graph& _graph, const Node &n) 173 173 : graph(&_graph) 174 174 { … … 177 177 178 178 // FIXME: Do we need this type of constructor here? 179 // UndirIncEdgeIt(const Graph& _graph, const Edge& e) :179 // IncEdgeIt(const Graph& _graph, const Edge& e) : 180 180 // UndirEdge(e), graph(&_graph), forward(_graph.forward(e)) { } 181 181 // or 182 // UndirIncEdgeIt(const Graph& _graph, const Node& n,182 // IncEdgeIt(const Graph& _graph, const Node& n, 183 183 // Const UndirEdge &e) ... ? 184 184 185 UndirIncEdgeIt& operator++() {185 IncEdgeIt& operator++() { 186 186 graph>_dirNextOut(*this); 187 187 return *this; … … 189 189 }; 190 190 191 Node source(const UndirIncEdgeIt &e) const {191 Node source(const IncEdgeIt &e) const { 192 192 return _dirSource(e); 193 193 } … … 198 198 199 199 /// Target of the given Edge. 200 Node target(const UndirIncEdgeIt &e) const {200 Node target(const IncEdgeIt &e) const { 201 201 return _dirTarget(e); 202 202 }
Note: See TracChangeset
for help on using the changeset viewer.