I encountered the same problem as you described in this issue. Generally, I would like to list all the integer flows in a single-source-single target maximal flow problem. According to the integer max flow theorem, I think the search should be polynomial. Nonetheless, I am not sure how to do it using graph-tool although it is fast and efficient. Could you please share some intuitive ideas to ? I am very appreciate your kindness.
-- Sent from: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/