Hello,
I would like to know if it is planned to make available the following function :
https://igraph.org/c/doc/igraph-Structural.html#igraph_get_k_shortest_paths
Or another implementation of the k-shortest-paths algorithm?

I would need these features to propose alternative paths on a DAG, as edge random deletion could happen in our problem.

Let me know if I can help in that.

Best regards, Léon