equal
deleted
inserted
replaced
270 else if(currConn==-1) |
270 else if(currConn==-1) |
271 ++_conn[n2]; |
271 ++_conn[n2]; |
272 } |
272 } |
273 } |
273 } |
274 |
274 |
275 void processBFSLevel(typename G1::Node source,unsigned int& orderIndex, |
275 void processBfsTree(typename G1::Node source,unsigned int& orderIndex, |
276 typename G1::template NodeMap<int>& dm1, |
276 typename G1::template NodeMap<int>& dm1, |
277 typename G1::template NodeMap<bool>& added) { |
277 typename G1::template NodeMap<bool>& added) { |
278 _order[orderIndex]=source; |
278 _order[orderIndex]=source; |
279 added[source]=1; |
279 added[source]=1; |
280 |
280 |
340 (_labelTmp1[_intLabels1[minNode]]> |
340 (_labelTmp1[_intLabels1[minNode]]> |
341 _labelTmp1[_intLabels1[n1]]||(dm1[minNode]<dm1[n1]&& |
341 _labelTmp1[_intLabels1[n1]]||(dm1[minNode]<dm1[n1]&& |
342 _labelTmp1[_intLabels1[minNode]]== |
342 _labelTmp1[_intLabels1[minNode]]== |
343 _labelTmp1[_intLabels1[n1]]))) |
343 _labelTmp1[_intLabels1[n1]]))) |
344 minNode=n1; |
344 minNode=n1; |
345 processBFSLevel(minNode,orderIndex,dm1,added); |
345 processBfsTree(minNode,orderIndex,dm1,added); |
346 } |
346 } |
347 else |
347 else |
348 ++n; |
348 ++n; |
349 } |
349 } |
350 for(unsigned int i = 0; i < _labelTmp1.size(); ++i) |
350 for(unsigned int i = 0; i < _labelTmp1.size(); ++i) |