mirror of https://gitee.com/bigwinds/arangodb
Fixed a bug where the shortest path computation computed the correct distancebut returned a wrong path. It was only triggered under very special conditions
This commit is contained in:
parent
0b0a9b81fb
commit
6eadcb31ff
|
@ -587,13 +587,16 @@ namespace triagens {
|
|||
// step is consumed!
|
||||
return;
|
||||
}
|
||||
delete step;
|
||||
if (s->_done) {
|
||||
delete step;
|
||||
return;
|
||||
}
|
||||
if (s->weight() > newWeight) {
|
||||
s->_predecessor = step->_predecessor;
|
||||
s->_edge = step->_edge;
|
||||
_myInfo._pq.lowerWeight(s->_vertex, newWeight);
|
||||
}
|
||||
delete step;
|
||||
}
|
||||
|
||||
////////////////////////////////////////////////////////////////////////////////
|
||||
|
|
Loading…
Reference in New Issue