equal
deleted
inserted
replaced
105 friend class InEdgeIt; |
105 friend class InEdgeIt; |
106 friend class SymEdge; |
106 friend class SymEdge; |
107 |
107 |
108 protected: |
108 protected: |
109 int n; |
109 int n; |
110 friend int FullGraph::id(Node v) const; |
110 friend int FullGraph::id(Node v); |
111 Node(int nn) {n=nn;} |
111 Node(int nn) {n=nn;} |
112 public: |
112 public: |
113 Node() {} |
113 Node() {} |
114 Node (Invalid) { n=-1; } |
114 Node (Invalid) { n=-1; } |
115 bool operator==(const Node i) const {return n==i.n;} |
115 bool operator==(const Node i) const {return n==i.n;} |
133 |
133 |
134 friend class Node; |
134 friend class Node; |
135 friend class NodeIt; |
135 friend class NodeIt; |
136 protected: |
136 protected: |
137 int n; //NodeNum*head+tail; |
137 int n; //NodeNum*head+tail; |
138 friend int FullGraph::id(Edge e) const; |
138 friend int FullGraph::id(Edge e); |
139 |
139 |
140 Edge(int nn) {n=nn;} |
140 Edge(int nn) {n=nn;} |
141 public: |
141 public: |
142 Edge() { } |
142 Edge() { } |
143 Edge (Invalid) { n=-1; } |
143 Edge (Invalid) { n=-1; } |