Shortest path tree with Dijkstra's algorithm

The `stepbackArbor`

function rebuilds an arborescence
present in earlier stage of Edmonds's algorithm to find a
minimum cost arborescence.

1 | ```
stepbackArbor(before, after)
``` |

`before` |
list with elements of the previous stage |

`after` |
list with elements of the next stage |

A updated list of elements of the earlier stage with a new arborescence

This function is an auxiliar function used in msArborEdmonds and getMinimumArborescence.

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

Please suggest features or report bugs with the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.