@Gabor Do you recall why the shortest paths obtained with Dijkstra are sorted? See here:

The unweighted version does not sort.

A Bellman-Ford version of the function was just added. Is there any reason to add the sorting to this new function?

@Gabor Do you recall why the shortest paths obtained with Dijkstra are sorted? See here:

The unweighted version does not sort.

A Bellman-Ford version of the function was just added. Is there any reason to add the sorting to this new function?

If the unweighted version does not, then it should, I guess, unless it is shorted in R.