In the second group of experiments, our symbolic algorithms are compared to the Dinic algorithm.
We choose randomly generated graphs with 200,000 edges and different numbers of nodes and the maximum edge capacities U = 1000. The run times are plotted in Fig. 12.
It can be observed that the run times of our symbolic algorithms decrease with the graph density.
Both groups of experiments indicate the fact that symbolic algorithms are competitive with traditional algorithms, especially on dense random graphs.