test_bellman_ford.cc File Reference

GoogleTest suite for Bellman_Ford.H. More...

#include <gtest/gtest.h>
#include <Bellman_Ford.H>
#include <tpl_graph.H>

Include dependency graph for test_bellman_ford.cc:

Go to the source code of this file.

Typedefs
using	GT = List_Digraph< Graph_Node< int >, Graph_Arc< int > >
using	Node = GT::Node
using	Arc = GT::Arc

Functions
	TEST (BellmanFordTest, SimpleGraphNoNegativeCycles)
	TEST (BellmanFordTest, GraphWithNegativeCycle)
	TEST (BellmanFordTest, SpanningTreePainting)
	TEST (BellmanFordTest, FasterVersion)
	TEST (BellmanFordTest, NegativeCycleDetectionFull)
	TEST (BellmanFordTest, SearchNegativeCycleWithParams)
	TEST (BellmanFordTest, TrivialGraphNoNegativeCycles)
	TEST (BellmanFordTest, GraphWithZeroWeights)
	TEST (BellmanFordTest, DisconnectedGraph)
	TEST (BellmanFordTest, NegativeWeightsNoCycle)
	TEST (BellmanFordTest, LargeGraphNoNegativeCycle)
	TEST (BellmanFordTest, ComplexNegativeCycle)
	TEST (BellmanFordTest, NegativeCycleWithOutputParameter)
	TEST (BellmanFordTest, SearchNegativeCycleNoStartNode)
	TEST (BellmanFordTest, NegativeCycleFunctor)
	TEST (BellmanFordTest, NegativeSelfLoop)
	TEST (BellmanFordTest, AllNegativeWeightsNoCycle)
	TEST (BellmanFordTest, NullptrValidation)
	TEST (BellmanFordTest, CompletelyEmptyGraph)
	TEST (BellmanFordTest, BuildTreeFromSpanningTree)
	TEST (BellmanFordTest, ExtractMinSpanningTree)
	TEST (BellmanFordTest, ComputeNodesWeightsJohnson)
	TEST (BellmanFordTest, ComputeNodesWeightsWithNegativeCycle)
	TEST (BellmanFordTest, HasNegativeCycleNoStartNode)
	TEST (BellmanFordTest, NegativeCycleNoParams)
	TEST (BellmanFordTest, GetMinPath)
	TEST (BellmanFordTest, GetMinPathToAllNodes)
	TEST (BellmanFordTest, ExtractMinSpanningTreeValidation)
	TEST (BellmanFordTest, BuildTreeWithMapping)
	TEST (BellmanFordTest, ComputeNodesWeightsValues)
	TEST (BellmanFordTest, NegativeCycleFunctorVariant1)
	TEST (BellmanFordTest, NegativeCycleFunctorWithStartNode)
	TEST (BellmanFordTest, SearchNegativeCycleWithDifferentItFactors)
	TEST (BellmanFordTest, EmptyGraphEdgeCase)
	TEST (BellmanFordTest, LargeGraphPerformance)
	TEST (BellmanFordTest, StateGetters)
	TEST (BellmanFordTest, GetMinPathWithoutPainting)
	TEST (BellmanFordTest, NegativeCyclePathValidity)
	TEST (BellmanFordTest, SingleNodePositiveSelfLoop)
	TEST (BellmanFordTest, FasterVersionWithNegativeCycle)
	TEST (BellmanFordTest, SearchNegativeCycleDoubleOverload)
	TEST (BellmanFordTest, SearchNegativeCycleNoParamsVariant)
	TEST (BellmanFordTest, BuildTreeWithoutPriorPainting)
	TEST (BellmanFordTest, MultiplePaintCalls)
	TEST (BellmanFordTest, FunctorDifferentSignatures)
	TEST (BellmanFordTest, StronglyConnectedWithNegativeCycle)
	TEST (BellmanFordTest, VeryLongChainPerformance)
	TEST (BellmanFordTest, BidirectionalEdges)
	TEST (BellmanFordTest, UnreachableNode)
	TEST (BellmanFordTest, DenseGraph)
	TEST (BellmanFordTest, GetDistance)
	TEST (BellmanFordTest, GetDistanceWithoutPainting)
	TEST (BellmanFordTest, GetDistanceUnreachableNode)
	TEST (BellmanFordTest, ExtractMinSpanningTreeWithoutPainting)
	TEST (BellmanFordTest, GetDistanceNullNode)
	TEST (BellmanFordTest, GetDistanceConsistentWithGetMinPath)
	TEST (BellmanFordTest, ParallelArcsChoosesMinimum)
	TEST (BellmanFordTest, ParallelArcsNegativeWeights)
	TEST (BellmanFordTest, ComplexMultigraph)
	TEST (BellmanFordTest, ParallelArcsNegativeCycle)
int	main (int argc, char **argv)

Detailed Description

GoogleTest suite for Bellman_Ford.H.

This file contains exhaustive tests to verify the correctness of the Bellman-Ford algorithm implementation in Aleph-w.

Tests for Test Bellman Ford

Definition in file test_bellman_ford.cc.

Typedef Documentation

Arc

using Arc = GT::Arc

Definition at line 23 of file test_bellman_ford.cc.

GT

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

Definition at line 21 of file test_bellman_ford.cc.

Node

using Node = GT::Node

Definition at line 22 of file test_bellman_ford.cc.

Function Documentation

main()

int main	(	int	argc,
		char **	argv
	)

Definition at line 1441 of file test_bellman_ford.cc.

References Aleph::maps().

TEST() [1/60]

TEST	(	BellmanFordTest	,
		AllNegativeWeightsNoCycle
	)

Definition at line 371 of file test_bellman_ford.cc.

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

TEST() [2/60]

TEST	(	BellmanFordTest	,
		BidirectionalEdges
	)

Definition at line 1121 of file test_bellman_ford.cc.

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

TEST() [3/60]

TEST	(	BellmanFordTest	,
		BuildTreeFromSpanningTree
	)

Definition at line 439 of file test_bellman_ford.cc.

References GraphCommon< GT, Node, Arc >::get_num_arcs(), GraphCommon< GT, Node, Arc >::get_num_nodes(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and Aleph::maps().

TEST() [4/60]

TEST	(	BellmanFordTest	,
		BuildTreeWithMapping
	)

Definition at line 676 of file test_bellman_ford.cc.

References GraphCommon< GT, Node, Arc >::get_num_arcs(), GraphCommon< GT, Node, Arc >::get_num_nodes(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and Aleph::maps().

TEST() [5/60]

TEST	(	BellmanFordTest	,
		BuildTreeWithoutPriorPainting
	)

Definition at line 985 of file test_bellman_ford.cc.

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

TEST() [6/60]

TEST	(	BellmanFordTest	,
		CompletelyEmptyGraph
	)

Definition at line 426 of file test_bellman_ford.cc.

References Aleph::has_cycle(), and Aleph::maps().

TEST() [7/60]

TEST	(	BellmanFordTest	,
		ComplexMultigraph
	)

Definition at line 1384 of file test_bellman_ford.cc.

References GraphCommon< GT, Node, Arc >::get_num_arcs(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and Aleph::maps().

TEST() [8/60]

TEST	(	BellmanFordTest	,
		ComplexNegativeCycle
	)

Definition at line 270 of file test_bellman_ford.cc.

References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::HTList::is_empty(), and Aleph::maps().

TEST() [9/60]

TEST	(	BellmanFordTest	,
		ComputeNodesWeightsJohnson
	)

Definition at line 498 of file test_bellman_ford.cc.

References GraphCommon< GT, Node, Arc >::get_num_nodes(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::maps(), and Aleph::HTList::size().

TEST() [10/60]

TEST	(	BellmanFordTest	,
		ComputeNodesWeightsValues
	)

Definition at line 715 of file test_bellman_ford.cc.

References LocateFunctions< Container, Type >::get_it(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::maps(), and Aleph::HTList::size().

TEST() [11/60]

TEST	(	BellmanFordTest	,
		ComputeNodesWeightsWithNegativeCycle
	)

Definition at line 518 of file test_bellman_ford.cc.

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

TEST() [12/60]

TEST	(	BellmanFordTest	,
		DenseGraph
	)

Definition at line 1167 of file test_bellman_ford.cc.

References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::maps(), N, and nodes.

TEST() [13/60]

TEST	(	BellmanFordTest	,
		DisconnectedGraph
	)

Definition at line 202 of file test_bellman_ford.cc.

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

TEST() [14/60]

TEST	(	BellmanFordTest	,
		EmptyGraphEdgeCase
	)

Definition at line 808 of file test_bellman_ford.cc.

References Aleph::has_cycle(), and Aleph::maps().

TEST() [15/60]

TEST	(	BellmanFordTest	,
		ExtractMinSpanningTree
	)

Definition at line 467 of file test_bellman_ford.cc.

References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::maps(), and Aleph::DynArray< T >::size().

TEST() [16/60]

TEST	(	BellmanFordTest	,
		ExtractMinSpanningTreeValidation
	)

Definition at line 639 of file test_bellman_ford.cc.

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

TEST() [17/60]

TEST	(	BellmanFordTest	,
		ExtractMinSpanningTreeWithoutPainting
	)

Definition at line 1259 of file test_bellman_ford.cc.

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

TEST() [18/60]

TEST	(	BellmanFordTest	,
		FasterVersion
	)

Definition at line 99 of file test_bellman_ford.cc.

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

TEST() [19/60]

TEST	(	BellmanFordTest	,
		FasterVersionWithNegativeCycle
	)

Definition at line 927 of file test_bellman_ford.cc.

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

TEST() [20/60]

TEST	(	BellmanFordTest	,
		FunctorDifferentSignatures
	)

Definition at line 1043 of file test_bellman_ford.cc.

References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::HTList::is_empty(), and Aleph::maps().

TEST() [21/60]

TEST	(	BellmanFordTest	,
		GetDistance
	)

Definition at line 1189 of file test_bellman_ford.cc.

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

TEST() [22/60]

TEST	(	BellmanFordTest	,
		GetDistanceConsistentWithGetMinPath
	)

Definition at line 1298 of file test_bellman_ford.cc.

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

TEST() [23/60]

TEST	(	BellmanFordTest	,
		GetDistanceNullNode
	)

Definition at line 1278 of file test_bellman_ford.cc.

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

TEST() [24/60]

TEST	(	BellmanFordTest	,
		GetDistanceUnreachableNode
	)

Definition at line 1237 of file test_bellman_ford.cc.

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

TEST() [25/60]

TEST	(	BellmanFordTest	,
		GetDistanceWithoutPainting
	)

Definition at line 1218 of file test_bellman_ford.cc.

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

TEST() [26/60]

TEST	(	BellmanFordTest	,
		GetMinPath
	)

Definition at line 580 of file test_bellman_ford.cc.

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

TEST() [27/60]

TEST	(	BellmanFordTest	,
		GetMinPathToAllNodes
	)

Definition at line 613 of file test_bellman_ford.cc.

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

TEST() [28/60]

TEST	(	BellmanFordTest	,
		GetMinPathWithoutPainting
	)

Definition at line 868 of file test_bellman_ford.cc.

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

TEST() [29/60]

TEST	(	BellmanFordTest	,
		GraphWithNegativeCycle
	)

Definition at line 48 of file test_bellman_ford.cc.

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

TEST() [30/60]

TEST	(	BellmanFordTest	,
		GraphWithZeroWeights
	)

Definition at line 183 of file test_bellman_ford.cc.

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

TEST() [31/60]

TEST	(	BellmanFordTest	,
		HasNegativeCycleNoStartNode
	)

Definition at line 542 of file test_bellman_ford.cc.

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

TEST() [32/60]

TEST	(	BellmanFordTest	,
		LargeGraphNoNegativeCycle
	)

Definition at line 243 of file test_bellman_ford.cc.

References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::maps(), nodes, and num_nodes.

TEST() [33/60]

TEST	(	BellmanFordTest	,
		LargeGraphPerformance
	)

Definition at line 818 of file test_bellman_ford.cc.

References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::maps(), N, and nodes.

TEST() [34/60]

TEST	(	BellmanFordTest	,
		MultiplePaintCalls
	)

Definition at line 1005 of file test_bellman_ford.cc.

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

TEST() [35/60]

TEST	(	BellmanFordTest	,
		NegativeCycleDetectionFull
	)

Definition at line 126 of file test_bellman_ford.cc.

References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::HTList::is_empty(), and Aleph::maps().

TEST() [36/60]

TEST	(	BellmanFordTest	,
		NegativeCycleFunctor
	)

Definition at line 335 of file test_bellman_ford.cc.

References Aleph::has_cycle(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::HTList::is_empty(), and Aleph::maps().

TEST() [37/60]

TEST	(	BellmanFordTest	,
		NegativeCycleFunctorVariant1
	)

Definition at line 741 of file test_bellman_ford.cc.

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

TEST() [38/60]

TEST	(	BellmanFordTest	,
		NegativeCycleFunctorWithStartNode
	)

Definition at line 762 of file test_bellman_ford.cc.

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

TEST() [39/60]

TEST	(	BellmanFordTest	,
		NegativeCycleNoParams
	)

Definition at line 560 of file test_bellman_ford.cc.

References Aleph::has_cycle(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::HTList::is_empty(), and Aleph::maps().

TEST() [40/60]

TEST	(	BellmanFordTest	,
		NegativeCyclePathValidity
	)

Definition at line 888 of file test_bellman_ford.cc.

References Aleph::Path< GT >::Iterator::has_current_node(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::HTList::is_empty(), and Aleph::maps().

TEST() [41/60]

TEST	(	BellmanFordTest	,
		NegativeCycleWithOutputParameter
	)

Definition at line 292 of file test_bellman_ford.cc.

References Aleph::has_cycle(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::HTList::is_empty(), and Aleph::maps().

TEST() [42/60]

TEST	(	BellmanFordTest	,
		NegativeSelfLoop
	)

Definition at line 355 of file test_bellman_ford.cc.

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

TEST() [43/60]

TEST	(	BellmanFordTest	,
		NegativeWeightsNoCycle
	)

Definition at line 223 of file test_bellman_ford.cc.

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

TEST() [44/60]

TEST	(	BellmanFordTest	,
		NullptrValidation
	)

Definition at line 391 of file test_bellman_ford.cc.

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

TEST() [45/60]

TEST	(	BellmanFordTest	,
		ParallelArcsChoosesMinimum
	)

Definition at line 1325 of file test_bellman_ford.cc.

References GraphCommon< GT, Node, Arc >::get_num_arcs(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and Aleph::maps().

TEST() [46/60]

TEST	(	BellmanFordTest	,
		ParallelArcsNegativeCycle
	)

Definition at line 1419 of file test_bellman_ford.cc.

References GraphCommon< GT, Node, Arc >::get_num_arcs(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and Aleph::maps().

TEST() [47/60]

TEST	(	BellmanFordTest	,
		ParallelArcsNegativeWeights
	)

Definition at line 1356 of file test_bellman_ford.cc.

References GraphCommon< GT, Node, Arc >::get_num_arcs(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and Aleph::maps().

TEST() [48/60]

TEST	(	BellmanFordTest	,
		SearchNegativeCycleDoubleOverload
	)

Definition at line 945 of file test_bellman_ford.cc.

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

TEST() [49/60]

TEST	(	BellmanFordTest	,
		SearchNegativeCycleNoParamsVariant
	)

Definition at line 965 of file test_bellman_ford.cc.

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

TEST() [50/60]

TEST	(	BellmanFordTest	,
		SearchNegativeCycleNoStartNode
	)

Definition at line 312 of file test_bellman_ford.cc.

References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::HTList::is_empty(), and Aleph::maps().

TEST() [51/60]

TEST	(	BellmanFordTest	,
		SearchNegativeCycleWithDifferentItFactors
	)

Definition at line 783 of file test_bellman_ford.cc.

References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::HTList::is_empty(), and Aleph::maps().

TEST() [52/60]

TEST	(	BellmanFordTest	,
		SearchNegativeCycleWithParams
	)

Definition at line 147 of file test_bellman_ford.cc.

References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::HTList::is_empty(), and Aleph::maps().

TEST() [53/60]

TEST	(	BellmanFordTest	,
		SimpleGraphNoNegativeCycles
	)

Definition at line 26 of file test_bellman_ford.cc.

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

TEST() [54/60]

TEST	(	BellmanFordTest	,
		SingleNodePositiveSelfLoop
	)

Definition at line 914 of file test_bellman_ford.cc.

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

TEST() [55/60]

TEST	(	BellmanFordTest	,
		SpanningTreePainting
	)

Definition at line 67 of file test_bellman_ford.cc.

References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), IS_ARC_VISITED, Aleph::maps(), Aleph::Filter_Iterator< Container, It, Show_Item >::next(), and Aleph::Spanning_Tree.

TEST() [56/60]

TEST	(	BellmanFordTest	,
		StateGetters
	)

Definition at line 845 of file test_bellman_ford.cc.

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

TEST() [57/60]

TEST	(	BellmanFordTest	,
		StronglyConnectedWithNegativeCycle
	)

Definition at line 1072 of file test_bellman_ford.cc.

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

TEST() [58/60]

TEST	(	BellmanFordTest	,
		TrivialGraphNoNegativeCycles
	)

Definition at line 171 of file test_bellman_ford.cc.

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

TEST() [59/60]

TEST	(	BellmanFordTest	,
		UnreachableNode
	)

Definition at line 1142 of file test_bellman_ford.cc.

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

TEST() [60/60]

TEST	(	BellmanFordTest	,
		VeryLongChainPerformance
	)

Definition at line 1097 of file test_bellman_ford.cc.

References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::maps(), N, and nodes.