|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
#include <gtest/gtest.h>#include <tpl_maxflow.H>#include <tpl_net.H>#include <chrono>#include <random>#include <stdexcept>Go to the source code of this file.
Functions | |
| TEST (DinicTest, LinearNetwork) | |
| TEST (DinicTest, DiamondNetwork) | |
| TEST (DinicTest, ComplexNetwork) | |
| TEST (DinicTest, ZeroCapacity) | |
| TEST (DinicTest, SingleArc) | |
| TEST (CapacityScalingTest, LinearNetwork) | |
| TEST (CapacityScalingTest, DiamondNetwork) | |
| TEST (CapacityScalingTest, ComplexNetwork) | |
| TEST (CapacityScalingTest, LargeCapacities) | |
| TEST (HLPPTest, LinearNetwork) | |
| TEST (HLPPTest, DiamondNetwork) | |
| TEST (HLPPTest, ComplexNetwork) | |
| TEST (FlowDecompositionTest, LinearFlow) | |
| TEST (FlowDecompositionTest, DiamondFlow) | |
| TEST (FlowDecompositionTest, ComplexFlow) | |
| TEST (FlowDecompositionTest, ZeroFlow) | |
| TEST (FlowDecompositionTest, CycleDetection) | |
| TEST (FlowStatisticsTest, BeforeFlow) | |
| TEST (FlowStatisticsTest, AfterFlow) | |
| template<class Net > | |
| double | compute_min_cut_capacity (Net &net) |
| template<class Net > | |
| bool | verify_max_flow_min_cut (Net &net, double max_flow) |
| TEST (MinCutTest, LinearNetwork) | |
| TEST (MinCutTest, DiamondNetwork) | |
| TEST (MinCutTest, ComplexNetwork) | |
| TEST (MinCutTest, GridNetwork) | |
| TEST (MinCutTest, SingleBottleneck) | |
| TEST (MinCutTest, ParallelArcs) | |
| TEST (MinCutTest, AllAlgorithmsGiveSameMinCut) | |
| TEST (MinCutTest, VerifyCutPartition) | |
| TEST (AlgorithmComparisonTest, AllAlgorithmsAgree) | |
| TEST (AlgorithmComparisonTest, GridNetwork) | |
| TEST (EdgeCasesTest, ParallelArcs) | |
| TEST (EdgeCasesTest, SourceBottleneck) | |
| TEST (EdgeCasesTest, SinkBottleneck) | |
| TEST (FunctorTest, DinicFunctor) | |
| TEST (FunctorTest, CapacityScalingFunctor) | |
| TEST (FunctorTest, HLPPFunctor) | |
| TEST (FunctorTest, DecomposeFunctor) | |
| TEST (PerformanceTest, Benchmark) | |
| TEST (RegressionTest, HLPPDisconnectedNodeRelabel) | |
| Node * | build_antiparallel_network (TestNet &net) |
| TEST (AntiParallelTest, AllAlgorithmsAgreeOnAntiParallel) | |
| TEST (AntiParallelTest, PureAntiParallel) | |
| TEST (CapacityScalingTest, FractionalCapacities) | |
| TEST (CapacityScalingTest, MixedIntegerFractional) | |
| template<class Net > | |
| void | verify_flow_conservation (const Net &net) |
| TEST (HLPPStressTest, LadderNetwork) | |
| TEST (HLPPStressTest, HighExcessBottleneck) | |
| TEST (FlowDecompositionTest, ArcFlowConsistency) | |
| TEST (FlowDecompositionTest, Phase2CycleClosingNode) | |
| TEST (FlowDecompositionTest, Phase1CycleClosingNode) | |
| TEST (DisconnectedTest, ZeroCapacityBottleneck) | |
| TEST (DisconnectedTest, InvalidNetworkThrows) | |
| TEST (DinicStressTest, LongChain) | |
| TEST (DinicStressTest, WideParallel) | |
| TEST (RandomStressTest, SmallRandomGraphs) | |
| TEST (RandomStressTest, MediumRandomGraphs) | |
| TEST (IntegerFlowTest, AllAlgorithmsAgree) | |
| TEST (IntegerFlowTest, ComplexIntegerNetwork) | |
| TEST (IntegerFlowTest, RandomIntegerGraphs) | |
| TEST (IntegerFlowTest, MinCutVerification) | |
| int | main (int argc, char **argv) |
Definition at line 923 of file tpl_maxflow_test.cc.
References Aleph::Net_Graph< NodeT, ArcT >::insert_arc(), and Aleph::Net_Graph< NodeT, ArcT >::insert_node().
Referenced by TEST().
Definition at line 414 of file tpl_maxflow_test.cc.
References Aleph::DynListQueue< T >::front(), Aleph::DynListQueue< T >::get(), GraphCommon< GT, Node, Arc >::get_connected_node(), Aleph::Net_Graph< NodeT, ArcT >::get_sink(), Aleph::Net_Graph< NodeT, ArcT >::get_source(), GraphCommon< GT, Node, Arc >::get_src_node(), GraphCommon< GT, Node, Arc >::get_tgt_node(), Aleph::Array_Iterator< T >::has_curr(), Aleph::Digraph_Iterator< GT, Filter >::has_curr(), Aleph::DynList< T >::insert(), Aleph::DynListQueue< T >::is_empty(), Aleph::maps(), and Aleph::DynListQueue< T >::put().
Referenced by TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), and verify_max_flow_min_cut().
| int main | ( | int | argc, |
| char ** | argv | ||
| ) |
Definition at line 1730 of file tpl_maxflow_test.cc.
References Aleph::maps().
| TEST | ( | AlgorithmComparisonTest | , |
| AllAlgorithmsAgree | |||
| ) |
Definition at line 688 of file tpl_maxflow_test.cc.
References Aleph::capacity_scaling_maximum_flow(), Aleph::dinic_maximum_flow(), Aleph::edmonds_karp_maximum_flow(), Aleph::ford_fulkerson_maximum_flow(), and Aleph::maps().
| TEST | ( | AlgorithmComparisonTest | , |
| GridNetwork | |||
| ) |
Definition at line 707 of file tpl_maxflow_test.cc.
References build_grid_network(), Aleph::capacity_scaling_maximum_flow(), Aleph::dinic_maximum_flow(), Aleph::edmonds_karp_maximum_flow(), Aleph::maps(), and Aleph::size().
| TEST | ( | AntiParallelTest | , |
| AllAlgorithmsAgreeOnAntiParallel | |||
| ) |
Definition at line 939 of file tpl_maxflow_test.cc.
References build_antiparallel_network(), Aleph::capacity_scaling_maximum_flow(), Aleph::dinic_maximum_flow(), Aleph::edmonds_karp_maximum_flow(), Aleph::ford_fulkerson_maximum_flow(), Aleph::hlpp_maximum_flow(), Aleph::maps(), and verify_max_flow_min_cut().
| TEST | ( | AntiParallelTest | , |
| PureAntiParallel | |||
| ) |
Definition at line 975 of file tpl_maxflow_test.cc.
References Aleph::Net_Graph< NodeT, ArcT >::check_network(), Aleph::dinic_maximum_flow(), Aleph::Net_Graph< NodeT, ArcT >::insert_arc(), Aleph::Net_Graph< NodeT, ArcT >::insert_node(), and Aleph::maps().
| TEST | ( | CapacityScalingTest | , |
| ComplexNetwork | |||
| ) |
Definition at line 206 of file tpl_maxflow_test.cc.
References Aleph::capacity_scaling_maximum_flow(), Aleph::Net_Graph< NodeT, ArcT >::check_network(), and Aleph::maps().
| TEST | ( | CapacityScalingTest | , |
| DiamondNetwork | |||
| ) |
Definition at line 195 of file tpl_maxflow_test.cc.
References Aleph::capacity_scaling_maximum_flow(), Aleph::Net_Graph< NodeT, ArcT >::check_network(), and Aleph::maps().
| TEST | ( | CapacityScalingTest | , |
| FractionalCapacities | |||
| ) |
Definition at line 1002 of file tpl_maxflow_test.cc.
References Aleph::capacity_scaling_maximum_flow(), Aleph::dinic_maximum_flow(), Aleph::Net_Graph< NodeT, ArcT >::insert_arc(), Aleph::Net_Graph< NodeT, ArcT >::insert_node(), and Aleph::maps().
| TEST | ( | CapacityScalingTest | , |
| LargeCapacities | |||
| ) |
Definition at line 217 of file tpl_maxflow_test.cc.
References Aleph::capacity_scaling_maximum_flow(), Aleph::Net_Graph< NodeT, ArcT >::insert_arc(), Aleph::Net_Graph< NodeT, ArcT >::insert_node(), and Aleph::maps().
| TEST | ( | CapacityScalingTest | , |
| LinearNetwork | |||
| ) |
Definition at line 184 of file tpl_maxflow_test.cc.
References Aleph::capacity_scaling_maximum_flow(), Aleph::Net_Graph< NodeT, ArcT >::check_network(), and Aleph::maps().
| TEST | ( | CapacityScalingTest | , |
| MixedIntegerFractional | |||
| ) |
Definition at line 1023 of file tpl_maxflow_test.cc.
References Aleph::capacity_scaling_maximum_flow(), Aleph::dinic_maximum_flow(), Aleph::Net_Graph< NodeT, ArcT >::insert_arc(), Aleph::Net_Graph< NodeT, ArcT >::insert_node(), and Aleph::maps().
| TEST | ( | DinicStressTest | , |
| LongChain | |||
| ) |
Definition at line 1402 of file tpl_maxflow_test.cc.
References Aleph::Net_Graph< NodeT, ArcT >::check_network(), Aleph::dinic_maximum_flow(), Aleph::Net_Graph< NodeT, ArcT >::insert_arc(), Aleph::Net_Graph< NodeT, ArcT >::insert_node(), and Aleph::maps().
| TEST | ( | DinicStressTest | , |
| WideParallel | |||
| ) |
| TEST | ( | DinicTest | , |
| ComplexNetwork | |||
| ) |
Definition at line 143 of file tpl_maxflow_test.cc.
References Aleph::Net_Graph< NodeT, ArcT >::check_network(), Aleph::dinic_maximum_flow(), and Aleph::maps().
| TEST | ( | DinicTest | , |
| DiamondNetwork | |||
| ) |
Definition at line 131 of file tpl_maxflow_test.cc.
References Aleph::Net_Graph< NodeT, ArcT >::check_network(), Aleph::dinic_maximum_flow(), and Aleph::maps().
| TEST | ( | DinicTest | , |
| LinearNetwork | |||
| ) |
Definition at line 120 of file tpl_maxflow_test.cc.
References Aleph::Net_Graph< NodeT, ArcT >::check_network(), Aleph::dinic_maximum_flow(), and Aleph::maps().
| TEST | ( | DinicTest | , |
| SingleArc | |||
| ) |
Definition at line 168 of file tpl_maxflow_test.cc.
References Aleph::dinic_maximum_flow(), Aleph::Net_Graph< NodeT, ArcT >::insert_arc(), Aleph::Net_Graph< NodeT, ArcT >::insert_node(), and Aleph::maps().
| TEST | ( | DinicTest | , |
| ZeroCapacity | |||
| ) |
Definition at line 155 of file tpl_maxflow_test.cc.
References Aleph::dinic_maximum_flow(), Aleph::Net_Graph< NodeT, ArcT >::insert_arc(), Aleph::Net_Graph< NodeT, ArcT >::insert_node(), and Aleph::maps().
| TEST | ( | DisconnectedTest | , |
| InvalidNetworkThrows | |||
| ) |
Definition at line 1378 of file tpl_maxflow_test.cc.
References Aleph::capacity_scaling_maximum_flow(), Aleph::dinic_maximum_flow(), Aleph::hlpp_maximum_flow(), Aleph::Net_Graph< NodeT, ArcT >::insert_arc(), Aleph::Net_Graph< NodeT, ArcT >::insert_node(), and Aleph::maps().
| TEST | ( | DisconnectedTest | , |
| ZeroCapacityBottleneck | |||
| ) |
Definition at line 1362 of file tpl_maxflow_test.cc.
References Aleph::dinic_maximum_flow(), Aleph::Net_Graph< NodeT, ArcT >::insert_arc(), Aleph::Net_Graph< NodeT, ArcT >::insert_node(), and Aleph::maps().
| TEST | ( | EdgeCasesTest | , |
| ParallelArcs | |||
| ) |
Definition at line 729 of file tpl_maxflow_test.cc.
References Aleph::dinic_maximum_flow(), Aleph::Net_Graph< NodeT, ArcT >::insert_arc(), Aleph::Net_Graph< NodeT, ArcT >::insert_node(), and Aleph::maps().
| TEST | ( | EdgeCasesTest | , |
| SinkBottleneck | |||
| ) |
Definition at line 758 of file tpl_maxflow_test.cc.
References Aleph::dinic_maximum_flow(), Aleph::Net_Graph< NodeT, ArcT >::insert_arc(), Aleph::Net_Graph< NodeT, ArcT >::insert_node(), and Aleph::maps().
| TEST | ( | EdgeCasesTest | , |
| SourceBottleneck | |||
| ) |
Definition at line 744 of file tpl_maxflow_test.cc.
References Aleph::dinic_maximum_flow(), Aleph::Net_Graph< NodeT, ArcT >::insert_arc(), Aleph::Net_Graph< NodeT, ArcT >::insert_node(), and Aleph::maps().
| TEST | ( | FlowDecompositionTest | , |
| ArcFlowConsistency | |||
| ) |
Definition at line 1204 of file tpl_maxflow_test.cc.
References Aleph::decompose_flow(), Aleph::dinic_maximum_flow(), LocateFunctions< Container, Type >::get_it(), Aleph::maps(), and Aleph::Filter_Iterator< Container, It, Show_Item >::next_ne().
| TEST | ( | FlowDecompositionTest | , |
| ComplexFlow | |||
| ) |
Definition at line 299 of file tpl_maxflow_test.cc.
References Aleph::decompose_flow(), Aleph::dinic_maximum_flow(), and Aleph::maps().
| TEST | ( | FlowDecompositionTest | , |
| CycleDetection | |||
| ) |
Definition at line 331 of file tpl_maxflow_test.cc.
References Aleph::decompose_flow(), Aleph::DynList< T >::get_first(), Aleph::Net_Graph< NodeT, ArcT >::insert_arc(), Aleph::Net_Graph< NodeT, ArcT >::insert_node(), and Aleph::maps().
| TEST | ( | FlowDecompositionTest | , |
| DiamondFlow | |||
| ) |
Definition at line 286 of file tpl_maxflow_test.cc.
References Aleph::decompose_flow(), Aleph::dinic_maximum_flow(), and Aleph::maps().
| TEST | ( | FlowDecompositionTest | , |
| LinearFlow | |||
| ) |
Definition at line 274 of file tpl_maxflow_test.cc.
References Aleph::decompose_flow(), Aleph::dinic_maximum_flow(), and Aleph::maps().
| TEST | ( | FlowDecompositionTest | , |
| Phase1CycleClosingNode | |||
| ) |
Definition at line 1312 of file tpl_maxflow_test.cc.
References Aleph::decompose_flow(), Aleph::DynList< T >::get_first(), LocateFunctions< Container, Type >::get_it(), Aleph::DynList< T >::get_last(), Aleph::Net_Graph< NodeT, ArcT >::insert_arc(), Aleph::Net_Graph< NodeT, ArcT >::insert_node(), and Aleph::maps().
| TEST | ( | FlowDecompositionTest | , |
| Phase2CycleClosingNode | |||
| ) |
Definition at line 1251 of file tpl_maxflow_test.cc.
References Aleph::decompose_flow(), Aleph::DynList< T >::get_first(), LocateFunctions< Container, Type >::get_it(), Aleph::DynList< T >::get_last(), Aleph::Net_Graph< NodeT, ArcT >::insert_arc(), Aleph::Net_Graph< NodeT, ArcT >::insert_node(), and Aleph::maps().
| TEST | ( | FlowDecompositionTest | , |
| ZeroFlow | |||
| ) |
Definition at line 313 of file tpl_maxflow_test.cc.
References Aleph::decompose_flow(), Aleph::Net_Graph< NodeT, ArcT >::insert_arc(), Aleph::Net_Graph< NodeT, ArcT >::insert_node(), and Aleph::maps().
| TEST | ( | FlowStatisticsTest | , |
| AfterFlow | |||
| ) |
Definition at line 395 of file tpl_maxflow_test.cc.
References Aleph::compute_flow_statistics(), Aleph::dinic_maximum_flow(), and Aleph::maps().
| TEST | ( | FlowStatisticsTest | , |
| BeforeFlow | |||
| ) |
Definition at line 382 of file tpl_maxflow_test.cc.
References Aleph::compute_flow_statistics(), and Aleph::maps().
| TEST | ( | FunctorTest | , |
| CapacityScalingFunctor | |||
| ) |
Definition at line 787 of file tpl_maxflow_test.cc.
References Aleph::maps().
| TEST | ( | FunctorTest | , |
| DecomposeFunctor | |||
| ) |
Definition at line 807 of file tpl_maxflow_test.cc.
References Aleph::dinic_maximum_flow(), and Aleph::maps().
| TEST | ( | FunctorTest | , |
| DinicFunctor | |||
| ) |
Definition at line 777 of file tpl_maxflow_test.cc.
References Aleph::maps().
| TEST | ( | FunctorTest | , |
| HLPPFunctor | |||
| ) |
Definition at line 797 of file tpl_maxflow_test.cc.
References Aleph::maps().
| TEST | ( | HLPPStressTest | , |
| HighExcessBottleneck | |||
| ) |
Definition at line 1172 of file tpl_maxflow_test.cc.
References Aleph::Net_Graph< NodeT, ArcT >::check_network(), Aleph::hlpp_maximum_flow(), Aleph::Net_Graph< NodeT, ArcT >::insert_arc(), Aleph::Net_Graph< NodeT, ArcT >::insert_node(), and Aleph::maps().
| TEST | ( | HLPPStressTest | , |
| LadderNetwork | |||
| ) |
Definition at line 1082 of file tpl_maxflow_test.cc.
References Aleph::Net_Graph< NodeT, ArcT >::check_network(), Aleph::Array< T >::create(), Aleph::dinic_maximum_flow(), Aleph::edmonds_karp_maximum_flow(), Aleph::hlpp_maximum_flow(), Aleph::Net_Graph< NodeT, ArcT >::insert_arc(), Aleph::Net_Graph< NodeT, ArcT >::insert_node(), Aleph::maps(), and N.
| TEST | ( | HLPPTest | , |
| ComplexNetwork | |||
| ) |
Definition at line 258 of file tpl_maxflow_test.cc.
References Aleph::Net_Graph< NodeT, ArcT >::check_network(), Aleph::hlpp_maximum_flow(), and Aleph::maps().
| TEST | ( | HLPPTest | , |
| DiamondNetwork | |||
| ) |
Definition at line 247 of file tpl_maxflow_test.cc.
References Aleph::Net_Graph< NodeT, ArcT >::check_network(), Aleph::hlpp_maximum_flow(), and Aleph::maps().
| TEST | ( | HLPPTest | , |
| LinearNetwork | |||
| ) |
Definition at line 236 of file tpl_maxflow_test.cc.
References Aleph::Net_Graph< NodeT, ArcT >::check_network(), Aleph::hlpp_maximum_flow(), and Aleph::maps().
| TEST | ( | IntegerFlowTest | , |
| AllAlgorithmsAgree | |||
| ) |
Definition at line 1579 of file tpl_maxflow_test.cc.
References Aleph::capacity_scaling_maximum_flow(), Aleph::dinic_maximum_flow(), Aleph::edmonds_karp_maximum_flow(), Aleph::hlpp_maximum_flow(), and Aleph::maps().
| TEST | ( | IntegerFlowTest | , |
| ComplexIntegerNetwork | |||
| ) |
Definition at line 1615 of file tpl_maxflow_test.cc.
References Aleph::capacity_scaling_maximum_flow(), Aleph::dinic_maximum_flow(), Aleph::hlpp_maximum_flow(), and Aleph::maps().
| TEST | ( | IntegerFlowTest | , |
| MinCutVerification | |||
| ) |
Definition at line 1683 of file tpl_maxflow_test.cc.
References Aleph::dinic_maximum_flow(), Aleph::hlpp_maximum_flow(), Aleph::maps(), and Aleph::Filter_Iterator< Container, It, Show_Item >::next_ne().
| TEST | ( | IntegerFlowTest | , |
| RandomIntegerGraphs | |||
| ) |
Definition at line 1653 of file tpl_maxflow_test.cc.
References Aleph::capacity_scaling_maximum_flow(), Aleph::dinic_maximum_flow(), Aleph::edmonds_karp_maximum_flow(), Aleph::hlpp_maximum_flow(), and Aleph::maps().
| TEST | ( | MinCutTest | , |
| AllAlgorithmsGiveSameMinCut | |||
| ) |
Definition at line 576 of file tpl_maxflow_test.cc.
References Aleph::capacity_scaling_maximum_flow(), compute_min_cut_capacity(), Aleph::dinic_maximum_flow(), Aleph::edmonds_karp_maximum_flow(), Aleph::ford_fulkerson_maximum_flow(), Aleph::maps(), and verify_max_flow_min_cut().
| TEST | ( | MinCutTest | , |
| ComplexNetwork | |||
| ) |
Definition at line 509 of file tpl_maxflow_test.cc.
References compute_min_cut_capacity(), Aleph::dinic_maximum_flow(), Aleph::maps(), Aleph::min_cut(), and verify_max_flow_min_cut().
| TEST | ( | MinCutTest | , |
| DiamondNetwork | |||
| ) |
Definition at line 496 of file tpl_maxflow_test.cc.
References compute_min_cut_capacity(), Aleph::dinic_maximum_flow(), Aleph::maps(), Aleph::min_cut(), and verify_max_flow_min_cut().
| TEST | ( | MinCutTest | , |
| GridNetwork | |||
| ) |
Definition at line 522 of file tpl_maxflow_test.cc.
References build_grid_network(), Aleph::edmonds_karp_maximum_flow(), Aleph::maps(), and verify_max_flow_min_cut().
| TEST | ( | MinCutTest | , |
| LinearNetwork | |||
| ) |
Definition at line 481 of file tpl_maxflow_test.cc.
References compute_min_cut_capacity(), Aleph::dinic_maximum_flow(), Aleph::maps(), Aleph::min_cut(), and verify_max_flow_min_cut().
| TEST | ( | MinCutTest | , |
| ParallelArcs | |||
| ) |
Definition at line 556 of file tpl_maxflow_test.cc.
References compute_min_cut_capacity(), Aleph::dinic_maximum_flow(), Aleph::Net_Graph< NodeT, ArcT >::insert_arc(), Aleph::Net_Graph< NodeT, ArcT >::insert_node(), Aleph::maps(), Aleph::min_cut(), and verify_max_flow_min_cut().
| TEST | ( | MinCutTest | , |
| SingleBottleneck | |||
| ) |
Definition at line 532 of file tpl_maxflow_test.cc.
References compute_min_cut_capacity(), Aleph::dinic_maximum_flow(), Aleph::Net_Graph< NodeT, ArcT >::insert_arc(), Aleph::Net_Graph< NodeT, ArcT >::insert_node(), Aleph::maps(), Aleph::min_cut(), and verify_max_flow_min_cut().
| TEST | ( | MinCutTest | , |
| VerifyCutPartition | |||
| ) |
Definition at line 607 of file tpl_maxflow_test.cc.
References Aleph::dinic_maximum_flow(), Aleph::DynListQueue< T >::front(), Aleph::DynListQueue< T >::get(), GraphCommon< GT, Node, Arc >::get_connected_node(), Aleph::Net_Graph< NodeT, ArcT >::get_sink(), Aleph::Net_Graph< NodeT, ArcT >::get_source(), GraphCommon< GT, Node, Arc >::get_src_node(), GraphCommon< GT, Node, Arc >::get_tgt_node(), Aleph::Array_Iterator< T >::has_curr(), Aleph::Digraph_Iterator< GT, Filter >::has_curr(), Aleph::DynList< T >::insert(), Aleph::DynListQueue< T >::is_empty(), Aleph::maps(), and Aleph::DynListQueue< T >::put().
| TEST | ( | PerformanceTest | , |
| Benchmark | |||
| ) |
Definition at line 824 of file tpl_maxflow_test.cc.
References build_grid_network(), Aleph::capacity_scaling_maximum_flow(), Aleph::dinic_maximum_flow(), Aleph::edmonds_karp_maximum_flow(), and Aleph::maps().
| TEST | ( | RandomStressTest | , |
| MediumRandomGraphs | |||
| ) |
Definition at line 1548 of file tpl_maxflow_test.cc.
References Aleph::dinic_maximum_flow(), Aleph::edmonds_karp_maximum_flow(), Aleph::hlpp_maximum_flow(), and Aleph::maps().
| TEST | ( | RandomStressTest | , |
| SmallRandomGraphs | |||
| ) |
Definition at line 1518 of file tpl_maxflow_test.cc.
References Aleph::capacity_scaling_maximum_flow(), Aleph::dinic_maximum_flow(), Aleph::edmonds_karp_maximum_flow(), Aleph::hlpp_maximum_flow(), and Aleph::maps().
| TEST | ( | RegressionTest | , |
| HLPPDisconnectedNodeRelabel | |||
| ) |
Definition at line 1058 of file tpl_maxflow_test.cc.
References GraphCommon< GT, Node, Arc >::get_src_node(), GraphCommon< GT, Node, Arc >::get_tgt_node(), Aleph::Net_Graph< NodeT, ArcT >::is_sink(), Aleph::Net_Graph< NodeT, ArcT >::is_source(), Aleph::maps(), and Aleph::Filter_Iterator< Container, It, Show_Item >::next_ne().
Definition at line 475 of file tpl_maxflow_test.cc.
References compute_min_cut_capacity(), and Aleph::min_cut().
Referenced by TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), and TEST().