Breadth-first search based shortest path finding algorithm that works even if the graph has edges with negative weights.
The algorithm uses igraph graph objects. See the installation instructions on the igraph project's website.
The library is open-sourced under the conditions of the MIT license.