equal
deleted
inserted
replaced
118 << ": id=" << G.id(e) << " oppid=" << G.id(G.opposite(e)) |
118 << ": id=" << G.id(e) << " oppid=" << G.id(G.opposite(e)) |
119 << " em=" << em[e] |
119 << " em=" << em[e] |
120 << " sm=" << sm[e] << "\n"; |
120 << " sm=" << sm[e] << "\n"; |
121 |
121 |
122 } |
122 } |
|
123 |
|
124 // Tests for NodeSet and EdgeSet |
|
125 |
|
126 { |
|
127 NodeSet N; |
|
128 |
|
129 typedef EdgeSet<NodeSet> ES; |
|
130 |
|
131 ES E(N); |
|
132 ES F(N); |
|
133 for(int i=0;i<10;i++) G.addNode(); |
|
134 |
|
135 for(ES::NodeIt n(E);E.valid(n);E.next(n)) |
|
136 for(ES::NodeIt m(E);E.valid(m);E.next(m)) |
|
137 if(n!=m) F.addEdge(n,m); |
|
138 for(ES::NodeIt n(F);F.valid(n);F.next(n)) |
|
139 for(ES::NodeIt m(F);F.valid(m);F.next(m)) |
|
140 if(n<m) F.addEdge(n,m); |
|
141 |
|
142 |
|
143 NodeSet::NodeMap<int> nm1(N); |
|
144 ES::NodeMap<int> nm2(E); |
|
145 ES::EdgeMap<int> eme(E); |
|
146 ES::EdgeMap<int> emf(F); |
|
147 |
|
148 |
|
149 } |
123 |
150 |
124 } |
151 } |