equal
deleted
inserted
replaced
68 /// Initialize the iterator to be invalid |
68 /// Initialize the iterator to be invalid |
69 Node(Invalid) : _n(0) { } |
69 Node(Invalid) : _n(0) { } |
70 //Node(const Node &) {} |
70 //Node(const Node &) {} |
71 bool operator==(Node n) const { return _n==n._n; } //FIXME |
71 bool operator==(Node n) const { return _n==n._n; } //FIXME |
72 bool operator!=(Node n) const { return _n!=n._n; } //FIXME |
72 bool operator!=(Node n) const { return _n!=n._n; } //FIXME |
|
73 operator leda_node () { return _n; } |
73 }; |
74 }; |
74 |
75 |
75 /// This iterator goes through each node. |
76 /// This iterator goes through each node. |
76 class NodeIt : public Node { |
77 class NodeIt : public Node { |
77 public: |
78 public: |
98 Edge() {} //FIXME |
99 Edge() {} //FIXME |
99 /// Initialize the iterator to be invalid |
100 /// Initialize the iterator to be invalid |
100 Edge(Invalid) : _e(0) {} |
101 Edge(Invalid) : _e(0) {} |
101 //Edge(const Edge &) {} |
102 //Edge(const Edge &) {} |
102 bool operator==(Edge e) const { return _e==e._e; } //FIXME |
103 bool operator==(Edge e) const { return _e==e._e; } //FIXME |
103 bool operator!=(Edge e) const { return _e!=e._e; } //FIXME |
104 bool operator!=(Edge e) const { return _e!=e._e; } //FIXME |
|
105 operator leda_edge () { return _e; } |
104 }; |
106 }; |
105 |
107 |
106 /// This iterator goes trought the outgoing edges of a certain graph. |
108 /// This iterator goes trought the outgoing edges of a certain graph. |
107 |
109 |
108 class OutEdgeIt : public Edge { |
110 class OutEdgeIt : public Edge { |