equal
deleted
inserted
replaced
193 for ( NodeIt u(*G) ; u!=INVALID ; ++u ) { |
193 for ( NodeIt u(*G) ; u!=INVALID ; ++u ) { |
194 predecessor->set(u,INVALID); |
194 predecessor->set(u,INVALID); |
195 pred_node->set(u,INVALID); |
195 pred_node->set(u,INVALID); |
196 } |
196 } |
197 |
197 |
198 int N=G->nodeNum(); |
198 int N = countNodes(*G); |
199 std::vector<typename Graph::Node> Q(N); |
199 std::vector<typename Graph::Node> Q(N); |
200 int Qh=0; |
200 int Qh=0; |
201 int Qt=0; |
201 int Qt=0; |
202 |
202 |
203 Q[Qh++]=source; |
203 Q[Qh++]=source; |