Hi,

i would like to get the longest path(s) in a weighted directed acylcical graph in R. In principle, I would just negate the weights and then get the shortest paths. However, the algorithms for dealing with negative weights (Bellman-Ford and Johnson) are only available for the `distances()`

function but not for the `shortest_paths(`

) or `all_shortest_paths()`

functions.

It seems these functions are available in the C library but I don’t know how to expose them to R.

Would it be possible to make the additional algorithms available for the shortest path functions in R? Or could someone point me towards how I could use the C functions directly from R?

Best and thanks

Jakob