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)
int	main (int argc, char **argv)

Function Documentation

main()

int main	(	int	argc,
		char **	argv
	)

Definition at line 477 of file tpl_mincost_test.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST() [1/19]

TEST	(	AlgorithmComparisonTest	,
		SSP_vs_CycleCanceling_CrossNetwork
	)

Definition at line 290 of file tpl_mincost_test.cc.

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

TEST() [2/19]

TEST	(	AlgorithmComparisonTest	,
		SSP_vs_CycleCanceling_Diamond
	)

Definition at line 272 of file tpl_mincost_test.cc.

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

TEST() [3/19]

TEST	(	AssignmentTest	,
		Basic3x3
	)

Definition at line 363 of file tpl_mincost_test.cc.

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

TEST() [4/19]

TEST	(	AssignmentTest	,
		Empty
	)

Definition at line 389 of file tpl_mincost_test.cc.

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

TEST() [5/19]

TEST	(	AssignmentTest	,
		Larger5x5
	)

Definition at line 399 of file tpl_mincost_test.cc.

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

TEST() [6/19]

TEST	(	AssignmentTest	,
		Single1x1
	)

Definition at line 378 of file tpl_mincost_test.cc.

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

TEST() [7/19]

TEST	(	PerformanceTest	,
		SSP_vs_CycleCanceling_OnLargerNetwork
	)

Definition at line 310 of file tpl_mincost_test.cc.

References Aleph::divide_and_conquer_partition_dp(), 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() [8/19]

TEST	(	SSPTest	,
		CompareWithCycleCanceling
	)

Definition at line 212 of file tpl_mincost_test.cc.

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

TEST() [9/19]

TEST	(	SSPTest	,
		CrossNetwork
	)

Definition at line 131 of file tpl_mincost_test.cc.

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

TEST() [10/19]

TEST	(	SSPTest	,
		DiamondNetwork
	)

Definition at line 116 of file tpl_mincost_test.cc.

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

TEST() [11/19]

TEST	(	SSPTest	,
		FunctorInterface
	)

Definition at line 201 of file tpl_mincost_test.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST() [12/19]

TEST	(	SSPTest	,
		LargeCosts
	)

Definition at line 159 of file tpl_mincost_test.cc.

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

TEST() [13/19]

TEST	(	SSPTest	,
		ParallelPaths
	)

Definition at line 143 of file tpl_mincost_test.cc.

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

TEST() [14/19]

TEST	(	SSPTest	,
		SimplePath
	)

Definition at line 104 of file tpl_mincost_test.cc.

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

TEST() [15/19]

TEST	(	SSPTest	,
		SingleArc
	)

Definition at line 175 of file tpl_mincost_test.cc.

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

TEST() [16/19]

TEST	(	SSPTest	,
		ZeroCapacity
	)

Definition at line 188 of file tpl_mincost_test.cc.

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

TEST() [17/19]

TEST	(	TransportationTest	,
		Balanced
	)

Definition at line 421 of file tpl_mincost_test.cc.

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

TEST() [18/19]

TEST	(	TransportationTest	,
		Imbalanced
	)

Definition at line 436 of file tpl_mincost_test.cc.

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

TEST() [19/19]

TEST	(	TransportationTest	,
		Larger3x4
	)

Definition at line 451 of file tpl_mincost_test.cc.

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