Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Functions
tpl_mincost_test.cc File Reference
#include <gtest/gtest.h>
#include <tpl_mincost.H>
#include <tpl_netcost.H>
Include dependency graph for tpl_mincost_test.cc:

Go to the source code of this file.

Functions

 TEST (SSPTest, SimplePath)
 
 TEST (SSPTest, DiamondNetwork)
 
 TEST (SSPTest, CrossNetwork)
 
 TEST (SSPTest, ParallelPaths)
 
 TEST (SSPTest, LargeCosts)
 
 TEST (SSPTest, SingleArc)
 
 TEST (SSPTest, ZeroCapacity)
 
 TEST (SSPTest, FunctorInterface)
 
 TEST (SSPTest, CompareWithCycleCanceling)
 
 TEST (AlgorithmComparisonTest, SSP_vs_CycleCanceling_Diamond)
 
 TEST (AlgorithmComparisonTest, SSP_vs_CycleCanceling_CrossNetwork)
 
 TEST (PerformanceTest, SSP_vs_CycleCanceling_OnLargerNetwork)
 
 TEST (AssignmentTest, Basic3x3)
 
 TEST (AssignmentTest, Single1x1)
 
 TEST (AssignmentTest, Empty)
 
 TEST (AssignmentTest, Larger5x5)
 
 TEST (TransportationTest, Balanced)
 
 TEST (TransportationTest, Imbalanced)
 
 TEST (TransportationTest, Larger3x4)
 
 TEST (NegCycleTest, RejectsNegativeCycle)
 
 TEST (NegCycleTest, AcceptsNonNegativeCostNetwork)
 
 TEST (SSPTest, ZeroDemandNodesHandledGracefully)
 
 TEST (AssignmentValidationTest, NonSquareMatrixThrows)
 
 TEST (AssignmentValidationTest, EmptyMatrixReturnsFeasible)
 
 TEST (TransportationValidationTest, MismatchedRowsThrows)
 
 TEST (TransportationValidationTest, MismatchedColumnsThrows)
 
 TEST (TransportationValidationTest, NegativeSupplyThrows)
 
 TEST (TransportationValidationTest, NegativeDemandThrows)
 
 TEST (TransportationValidationTest, EmptySuppliesNonemptyDemandsInfeasible)
 
 TEST (TransportationValidationTest, EmptySuppliesZeroDemandFeasible)
 
 TEST (TransportationValidationTest, BothEmptyFeasible)
 
int main (int argc, char **argv)
 

Function Documentation

◆ main()

int main ( int  argc,
char **  argv 
)

Definition at line 636 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching().

◆ TEST() [1/31]

TEST ( AlgorithmComparisonTest  ,
SSP_vs_CycleCanceling_CrossNetwork   
)

Definition at line 290 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::max_flow_min_cost_by_cycle_canceling(), and Aleph::successive_shortest_paths().

◆ TEST() [2/31]

TEST ( AlgorithmComparisonTest  ,
SSP_vs_CycleCanceling_Diamond   
)

Definition at line 272 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::max_flow_min_cost_by_cycle_canceling(), and Aleph::successive_shortest_paths().

◆ TEST() [3/31]

TEST ( AssignmentTest  ,
Basic3x3   
)

Definition at line 363 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::solve_assignment().

◆ TEST() [4/31]

TEST ( AssignmentTest  ,
Empty   
)

Definition at line 389 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::solve_assignment().

◆ TEST() [5/31]

TEST ( AssignmentTest  ,
Larger5x5   
)

Definition at line 399 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::solve_assignment().

◆ TEST() [6/31]

TEST ( AssignmentTest  ,
Single1x1   
)

Definition at line 378 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::solve_assignment().

◆ TEST() [7/31]

TEST ( AssignmentValidationTest  ,
EmptyMatrixReturnsFeasible   
)

Definition at line 562 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::solve_assignment().

◆ TEST() [8/31]

TEST ( AssignmentValidationTest  ,
NonSquareMatrixThrows   
)

Definition at line 556 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::solve_assignment().

◆ TEST() [9/31]

TEST ( NegCycleTest  ,
AcceptsNonNegativeCostNetwork   
)

Definition at line 516 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::Net_Graph< NodeT, ArcT >::insert_arc(), Aleph::Net_Graph< NodeT, ArcT >::insert_node(), and Aleph::successive_shortest_paths().

◆ TEST() [10/31]

TEST ( NegCycleTest  ,
RejectsNegativeCycle   
)

Definition at line 497 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::Net_Graph< NodeT, ArcT >::insert_arc(), Aleph::Net_Graph< NodeT, ArcT >::insert_node(), and Aleph::successive_shortest_paths().

◆ TEST() [11/31]

TEST ( PerformanceTest  ,
SSP_vs_CycleCanceling_OnLargerNetwork   
)

Definition at line 310 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::Net_Graph< NodeT, ArcT >::insert_arc(), Aleph::Net_Graph< NodeT, ArcT >::insert_node(), Aleph::max_flow_min_cost_by_cycle_canceling(), nodes, and Aleph::successive_shortest_paths().

◆ TEST() [12/31]

TEST ( SSPTest  ,
CompareWithCycleCanceling   
)

Definition at line 212 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::max_flow_min_cost_by_cycle_canceling(), and Aleph::successive_shortest_paths().

◆ TEST() [13/31]

TEST ( SSPTest  ,
CrossNetwork   
)

Definition at line 131 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::Net_Graph< NodeT, ArcT >::check_network(), and Aleph::successive_shortest_paths().

◆ TEST() [14/31]

TEST ( SSPTest  ,
DiamondNetwork   
)

Definition at line 116 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::Net_Graph< NodeT, ArcT >::check_network(), and Aleph::successive_shortest_paths().

◆ TEST() [15/31]

TEST ( SSPTest  ,
FunctorInterface   
)

Definition at line 201 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching().

◆ TEST() [16/31]

TEST ( SSPTest  ,
LargeCosts   
)

Definition at line 159 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::Net_Graph< NodeT, ArcT >::insert_arc(), Aleph::Net_Graph< NodeT, ArcT >::insert_node(), and Aleph::successive_shortest_paths().

◆ TEST() [17/31]

TEST ( SSPTest  ,
ParallelPaths   
)

Definition at line 143 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::Net_Graph< NodeT, ArcT >::check_network(), and Aleph::successive_shortest_paths().

◆ TEST() [18/31]

TEST ( SSPTest  ,
SimplePath   
)

Definition at line 104 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::Net_Graph< NodeT, ArcT >::check_network(), and Aleph::successive_shortest_paths().

◆ TEST() [19/31]

TEST ( SSPTest  ,
SingleArc   
)

Definition at line 175 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::Net_Graph< NodeT, ArcT >::insert_arc(), Aleph::Net_Graph< NodeT, ArcT >::insert_node(), and Aleph::successive_shortest_paths().

◆ TEST() [20/31]

TEST ( SSPTest  ,
ZeroCapacity   
)

Definition at line 188 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::Net_Graph< NodeT, ArcT >::insert_arc(), Aleph::Net_Graph< NodeT, ArcT >::insert_node(), and Aleph::successive_shortest_paths().

◆ TEST() [21/31]

TEST ( SSPTest  ,
ZeroDemandNodesHandledGracefully   
)

Definition at line 539 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::solve_transportation().

◆ TEST() [22/31]

TEST ( TransportationTest  ,
Balanced   
)

Definition at line 421 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::solve_transportation().

◆ TEST() [23/31]

TEST ( TransportationTest  ,
Imbalanced   
)

Definition at line 436 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::solve_transportation().

◆ TEST() [24/31]

TEST ( TransportationTest  ,
Larger3x4   
)

Definition at line 451 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::solve_transportation().

◆ TEST() [25/31]

TEST ( TransportationValidationTest  ,
BothEmptyFeasible   
)

Definition at line 627 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::solve_transportation().

◆ TEST() [26/31]

TEST ( TransportationValidationTest  ,
EmptySuppliesNonemptyDemandsInfeasible   
)

Definition at line 607 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::solve_transportation().

◆ TEST() [27/31]

TEST ( TransportationValidationTest  ,
EmptySuppliesZeroDemandFeasible   
)

Definition at line 617 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::solve_transportation().

◆ TEST() [28/31]

TEST ( TransportationValidationTest  ,
MismatchedColumnsThrows   
)

Definition at line 580 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::solve_transportation().

◆ TEST() [29/31]

TEST ( TransportationValidationTest  ,
MismatchedRowsThrows   
)

Definition at line 571 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::solve_transportation().

◆ TEST() [30/31]

TEST ( TransportationValidationTest  ,
NegativeDemandThrows   
)

Definition at line 597 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::solve_transportation().

◆ TEST() [31/31]

TEST ( TransportationValidationTest  ,
NegativeSupplyThrows   
)

Definition at line 589 of file tpl_mincost_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::solve_transportation().