Warm start max flow

Is it possible to warm start the max flow in igraph?

I am currently solving max flows on a DAG iteratively and deleting nodes between iterations, but I would like to pass previous solutions if possible. I’m not sure if that would even speed things up, hoping for insight on that part too.

This is not possible in the current implementation. In principle it might be possible to implement something along those lines. However, this does not seem to be trivial in the current implementation.

Perhaps it would be easier to implement a specific maxflow algorithm for your purpose? I wouldn’t have any suggestions for particular algorithms that would best suit your needs though.