int maxFlow(std::vector < std::vector < int > > array, int start, int finish)
{
int flow = 0;
while (true)
{
std::vector < bool > vct(array.size());
int df = findPath(array, vct, start, finish, INT_MAX);
if (df == 0)
{
return flow;
}
flow += df;
}
}
TEST(RadixSortRand, RadixSortTest) {
static constexpr size_t n = 1 << 20;
U32Vector vct(n);
for (size_t i = 0; i < n; ++i) {
vct[i] = rand();
}
U32Vector copy1(vct);
U32Vector copy2(vct);
{
Timer t("radix");
radixSort(copy1);
}
{
Timer t("std::sort");
sort(copy2.begin(), copy2.end());
}
for (size_t i = 1; i < n; ++i) {
EXPECT_LE(copy1[i - 1], copy1[i]);
}
}
