test_dial.cc File Reference

Comprehensive tests for Dial.H. More...

#include <gtest/gtest.h>
#include <cstdint>
#include <Dial.H>
#include <Dijkstra.H>
#include <tpl_graph.H>

Include dependency graph for test_dial.cc:

Go to the source code of this file.

Classes
struct	Int8Dist

Typedefs
using	GT = List_Graph< Graph_Node< int >, Graph_Arc< int > >
using	Node = GT::Node
using	Arc = GT::Arc
using	DGT = List_Digraph< Graph_Node< int >, Graph_Arc< int > >
using	DNode = DGT::Node
using	DArc = DGT::Arc

Functions
	TEST (Dial, BasicShortestPath)
	TEST (Dial, PathToSelf)
	TEST (Dial, NoPathExists)
	TEST (Dial, SingleNode)
	TEST (Dial, LinearChain)
	TEST (Dial, AllZeroWeights)
	TEST (Dial, WeightOneEdges)
	TEST (Dial, NullNodeValidation)
	TEST (Dial, NegativeWeightValidation)
	TEST (Dial, PaintAndGetMinPath)
	TEST (Dial, GetDistanceAfterPainting)
	TEST (Dial, GetDistanceBeforePainting)
	TEST (Dial, CrossValidationWithDijkstra)
	TEST (Dial, DigraphBasic)
	TEST (Dial, DigraphNoReturn)
	TEST (Dial, MultipleComputations)
	TEST (Dial, LargeLinearGraph)
	TEST (Dial, LargeWeights)
	TEST (Dial, PathNodeVerification)
	TEST (Dial, CompleteGraphK4)
	TEST (Dial, GraphWithCycle)
	TEST (Dial, StateGetters)
	TEST (Dial, DisconnectedPainting)
	TEST (Dial, RelaxationCorrectness)
	TEST (Dial, StarGraph)
	TEST (Dial, RoadNetworkExample)
	TEST (Dial, LargerCrossValidation)
	TEST (Dial, DistanceTypeOverflowValidation)
	TEST (Dial, BucketUpperBoundValidation)
	TEST (Dial, ParallelEdgesKeepSingleParentArcMarked)

Detailed Description

Comprehensive tests for Dial.H.

Tests cover correctness, edge cases, validation, and cross-checks against Dijkstra's algorithm for integer-weighted graphs.

Definition in file test_dial.cc.

Typedef Documentation

Arc

using Arc = GT::Arc

Definition at line 23 of file test_dial.cc.

DArc

using DArc = DGT::Arc

Definition at line 27 of file test_dial.cc.

DGT

using DGT = List_Digraph<Graph_Node<int>, Graph_Arc<int> >

Definition at line 25 of file test_dial.cc.

DNode

using DNode = DGT::Node

Definition at line 26 of file test_dial.cc.

GT

using GT = List_Graph<Graph_Node<int>, Graph_Arc<int> >

Definition at line 21 of file test_dial.cc.

Node

using Node = GT::Node

Definition at line 22 of file test_dial.cc.

Function Documentation

TEST() [1/30]

TEST	(	Dial	,
		AllZeroWeights
	)

Definition at line 136 of file test_dial.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), and Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node().

TEST() [2/30]

TEST	(	Dial	,
		BasicShortestPath
	)

Definition at line 42 of file test_dial.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), and Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node().

TEST() [3/30]

TEST	(	Dial	,
		BucketUpperBoundValidation
	)

Definition at line 677 of file test_dial.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), and Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node().

TEST() [4/30]

TEST	(	Dial	,
		CompleteGraphK4
	)

Definition at line 452 of file test_dial.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), and Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node().

TEST() [5/30]

TEST	(	Dial	,
		CrossValidationWithDijkstra
	)

Definition at line 279 of file test_dial.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), and Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node().

TEST() [6/30]

TEST	(	Dial	,
		DigraphBasic
	)

Definition at line 314 of file test_dial.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST() [7/30]

TEST	(	Dial	,
		DigraphNoReturn
	)

Definition at line 334 of file test_dial.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST() [8/30]

TEST	(	Dial	,
		DisconnectedPainting
	)

Definition at line 522 of file test_dial.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and Aleph::Dial_Min_Paths< GT, Distance, Itor, SA >::paint_min_paths_tree().

TEST() [9/30]

TEST	(	Dial	,
		DistanceTypeOverflowValidation
	)

Definition at line 658 of file test_dial.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), and Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node().

TEST() [10/30]

TEST	(	Dial	,
		GetDistanceAfterPainting
	)

Definition at line 243 of file test_dial.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and Aleph::Dial_Min_Paths< GT, Distance, Itor, SA >::paint_min_paths_tree().

TEST() [11/30]

TEST	(	Dial	,
		GetDistanceBeforePainting
	)

Definition at line 267 of file test_dial.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node().

TEST() [12/30]

TEST	(	Dial	,
		GraphWithCycle
	)

Definition at line 477 of file test_dial.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), and Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node().

TEST() [13/30]

TEST	(	Dial	,
		LargeLinearGraph
	)

Definition at line 376 of file test_dial.cc.

References Aleph::Array< T >::create(), Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), N, and nodes.

TEST() [14/30]

TEST	(	Dial	,
		LargerCrossValidation
	)

Definition at line 626 of file test_dial.cc.

References Aleph::Array< T >::create(), Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), N, and nodes.

TEST() [15/30]

TEST	(	Dial	,
		LargeWeights
	)

Definition at line 398 of file test_dial.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), and Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node().

TEST() [16/30]

TEST	(	Dial	,
		LinearChain
	)

Definition at line 114 of file test_dial.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), and Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node().

TEST() [17/30]

TEST	(	Dial	,
		MultipleComputations
	)

Definition at line 354 of file test_dial.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), and Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node().

TEST() [18/30]

TEST	(	Dial	,
		NegativeWeightValidation
	)

Definition at line 194 of file test_dial.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), IS_ARC_VISITED, IS_NODE_VISITED, NODE_COOKIE, and Aleph::Spanning_Tree.

TEST() [19/30]

TEST	(	Dial	,
		NoPathExists
	)

Definition at line 82 of file test_dial.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and Aleph::Path< GT >::is_empty().

TEST() [20/30]

TEST	(	Dial	,
		NullNodeValidation
	)

Definition at line 179 of file test_dial.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node().

TEST() [21/30]

TEST	(	Dial	,
		PaintAndGetMinPath
	)

Definition at line 218 of file test_dial.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and Aleph::Dial_Min_Paths< GT, Distance, Itor, SA >::paint_min_paths_tree().

TEST() [22/30]

TEST	(	Dial	,
		ParallelEdgesKeepSingleParentArcMarked
	)

Definition at line 695 of file test_dial.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), IS_ARC_VISITED, Aleph::Dial_Min_Paths< GT, Distance, Itor, SA >::paint_min_paths_tree(), and Aleph::Spanning_Tree.

TEST() [23/30]

TEST	(	Dial	,
		PathNodeVerification
	)

Definition at line 418 of file test_dial.cc.

References Aleph::DynList< T >::append(), Aleph::divide_and_conquer_partition_dp(), Aleph::Dlink::Iterator::has_curr(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and nodes.

TEST() [24/30]

TEST	(	Dial	,
		PathToSelf
	)

Definition at line 67 of file test_dial.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node().

TEST() [25/30]

TEST	(	Dial	,
		RelaxationCorrectness
	)

Definition at line 543 of file test_dial.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), and Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node().

TEST() [26/30]

TEST	(	Dial	,
		RoadNetworkExample
	)

Definition at line 600 of file test_dial.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and Aleph::Path< GT >::is_empty().

TEST() [27/30]

TEST	(	Dial	,
		SingleNode
	)

Definition at line 99 of file test_dial.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node().

TEST() [28/30]

TEST	(	Dial	,
		StarGraph
	)

Definition at line 564 of file test_dial.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and Aleph::Dial_Min_Paths< GT, Distance, Itor, SA >::paint_min_paths_tree().

TEST() [29/30]

TEST	(	Dial	,
		StateGetters
	)

Definition at line 499 of file test_dial.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), and Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node().

TEST() [30/30]

TEST	(	Dial	,
		WeightOneEdges
	)

Definition at line 156 of file test_dial.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), and Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node().