The maximum flow problem based on contact graph in DTN is very important for routing and data planning. Common topological graphs with non-sequential changes include Dinic, ISAP and other deterministi
NOTE: This dataset is now outdated. Please see https://doi.org/10.11583/DTU.17091101 for the updated version with many more problems. This is a collection of min-cut/max-flow problem instances that
