tpl_sgraph_test.cc File Reference

Tests for Tpl Sgraph. More...

#include <gtest/gtest.h>
#include <tpl_sgraph.H>
#include <string>
#include <vector>

Include dependency graph for tpl_sgraph_test.cc:

Go to the source code of this file.

Functions
	TEST (GraphSnode, DefaultConstruction)
	TEST (GraphSnode, ConstructionWithInfo)
	TEST (GraphSnode, CopyConstruction)
	TEST (GraphSnode, MoveConstruction)
	TEST (GraphSnode, CopyAssignment)
	TEST (GraphSnode, SelfAssignment)
	TEST (GraphSnode, ConstructionFromPointer)
	TEST (GraphSarc, DefaultConstruction)
	TEST (GraphSarc, ConstructionWithInfo)
	TEST (GraphSarc, CopyConstruction)
	TEST (GraphSarc, CopyAssignment)
	TEST (GraphSarc, SelfAssignment)
	TEST (GraphSarc, ConstructionWithEndpoints)
	TEST (ListSGraph, DefaultConstruction)
	TEST (ListSGraph, InsertNode)
	TEST (ListSGraph, InsertArc)
	TEST (ListSGraph, UndirectedArcSymmetry)
	TEST (ListSGraph, RemoveArc)
	TEST (ListSGraph, RemoveNode)
	TEST (ListSGraph, MultipleArcs)
	TEST (ListSDigraph, IsDirected)
	TEST (ListSDigraph, DirectedArcAsymmetry)
	TEST (ListSDigraph, BidirectionalArcs)
	TEST (ListSGraph, NodeIterator)
	TEST (ListSGraph, ArcIterator)
	TEST (ListSGraph, NodeArcIterator)
	TEST (ListSGraph, NodeArcIteratorGetTgtNode)
	TEST (ListSGraph, ArcIteratorGetEndpoints)
	TEST (ListSGraph, CopyConstruction)
	TEST (ListSGraph, MoveConstruction)
	TEST (ListSGraph, CopyAssignment)
	TEST (ListSGraph, SelfAssignment)
	TEST (ListSGraph, MoveAssignment)
	TEST (ListSDigraph, CopyConstruction)
	TEST (ListSDigraph, MoveConstruction)
	TEST (ListSDigraph, CopyAssignment)
	TEST (ListSDigraph, MoveAssignment)
	TEST (ListSGraph, LargeGraph)
	TEST (ListSDigraph, LargeDigraph)
	TEST (ListSGraph, SelfLoop)
	TEST (ListSDigraph, SelfLoop)
	TEST (ListSGraph, EmptyGraphIterators)
	TEST (ListSGraph, GetFirstNodeArc)
	TEST (ListSGraph, GetFirstArcNodeThrowsWhenEmpty)
	TEST (ListSGraph, RemoveAllNodes)
	TEST (ListSGraph, SwapGraphs)
	TEST (ListSGraph, StringNodeInfo)
	TEST (ListSGraph, NodeIteratorCurrentNode)
	TEST (ListSGraph, NodeArcIteratorCurrentArc)
	TEST (ListSGraph, ArcIteratorCurrentArc)
	TEST (ListSGraph, ComplexOperations)
	TEST (DigraphWrapper, DigraphInheritsFromBaseGraph)
	TEST (DigraphWrapper, DigraphCopyPreservesDirectedFlag)
	TEST (DigraphWrapper, DigraphMovePreservesDirectedFlag)
	TEST (DigraphWrapper, DigraphCopyAssignmentPreservesDirectedFlag)
	TEST (DigraphWrapper, DigraphMoveAssignmentPreservesDirectedFlag)
	TEST (DigraphWrapper, DigraphSelfAssignment)
	TEST (DigraphWrapper, DirectedArcNotVisibleFromTarget)
	TEST (ConceptsTest, SGraphIteratorsSatisfyConcepts)

Detailed Description

Tests for Tpl Sgraph.

Definition in file tpl_sgraph_test.cc.

Function Documentation

TEST() [1/59]

TEST	(	ConceptsTest	,
		SGraphIteratorsSatisfyConcepts
	)

Definition at line 867 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp(), GraphCommon< GT, Node, Arc >::get_arc_it(), GraphCommon< GT, Node, Arc >::get_node_it(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), and Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node().

TEST() [2/59]

TEST	(	DigraphWrapper	,
		DigraphCopyAssignmentPreservesDirectedFlag
	)

Definition at line 800 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST() [3/59]

TEST	(	DigraphWrapper	,
		DigraphCopyPreservesDirectedFlag
	)

Definition at line 776 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST() [4/59]

TEST	(	DigraphWrapper	,
		DigraphInheritsFromBaseGraph
	)

Definition at line 759 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST() [5/59]

TEST	(	DigraphWrapper	,
		DigraphMoveAssignmentPreservesDirectedFlag
	)

Definition at line 814 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST() [6/59]

TEST	(	DigraphWrapper	,
		DigraphMovePreservesDirectedFlag
	)

Definition at line 788 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST() [7/59]

TEST	(	DigraphWrapper	,
		DigraphSelfAssignment
	)

Definition at line 827 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST() [8/59]

TEST	(	DigraphWrapper	,
		DirectedArcNotVisibleFromTarget
	)

Definition at line 841 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST() [9/59]

TEST	(	GraphSarc	,
		ConstructionWithEndpoints
	)

Definition at line 147 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp(), GTArcCommon< ArcInfo >::get_info(), GTArcCommon< ArcInfo >::src_node, and GTArcCommon< ArcInfo >::tgt_node.

TEST() [10/59]

TEST	(	GraphSarc	,
		ConstructionWithInfo
	)

Definition at line 119 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp(), and GTArcCommon< ArcInfo >::get_info().

TEST() [11/59]

TEST	(	GraphSarc	,
		CopyAssignment
	)

Definition at line 132 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp(), and GTArcCommon< ArcInfo >::get_info().

TEST() [12/59]

TEST	(	GraphSarc	,
		CopyConstruction
	)

Definition at line 125 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp(), and GTArcCommon< ArcInfo >::get_info().

TEST() [13/59]

TEST	(	GraphSarc	,
		DefaultConstruction
	)

Definition at line 113 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp(), and GTArcCommon< ArcInfo >::get_info().

TEST() [14/59]

TEST	(	GraphSarc	,
		SelfAssignment
	)

Definition at line 140 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp(), and GTArcCommon< ArcInfo >::get_info().

TEST() [15/59]

TEST	(	GraphSnode	,
		ConstructionFromPointer
	)

Definition at line 102 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST() [16/59]

TEST	(	GraphSnode	,
		ConstructionWithInfo
	)

Definition at line 64 of file tpl_sgraph_test.cc.

References Aleph::Graph_Snode< Node_Info >::arc_list, Aleph::divide_and_conquer_partition_dp(), GTNodeCommon< NodeInfo >::get_info(), Aleph::HTList::is_empty(), and GTNodeCommon< NodeInfo >::num_arcs.

TEST() [17/59]

TEST	(	GraphSnode	,
		CopyAssignment
	)

Definition at line 87 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST() [18/59]

TEST	(	GraphSnode	,
		CopyConstruction
	)

Definition at line 72 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST() [19/59]

TEST	(	GraphSnode	,
		DefaultConstruction
	)

Definition at line 57 of file tpl_sgraph_test.cc.

References Aleph::Graph_Snode< Node_Info >::arc_list, Aleph::divide_and_conquer_partition_dp(), Aleph::HTList::is_empty(), and GTNodeCommon< NodeInfo >::num_arcs.

TEST() [20/59]

TEST	(	GraphSnode	,
		MoveConstruction
	)

Definition at line 80 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST() [21/59]

TEST	(	GraphSnode	,
		SelfAssignment
	)

Definition at line 95 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp(), and GTNodeCommon< NodeInfo >::get_info().

TEST() [22/59]

TEST	(	ListSDigraph	,
		BidirectionalArcs
	)

Definition at line 282 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST() [23/59]

TEST	(	ListSDigraph	,
		CopyAssignment
	)

Definition at line 494 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST() [24/59]

TEST	(	ListSDigraph	,
		CopyConstruction
	)

Definition at line 468 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST() [25/59]

TEST	(	ListSDigraph	,
		DirectedArcAsymmetry
	)

Definition at line 269 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST() [26/59]

TEST	(	ListSDigraph	,
		IsDirected
	)

Definition at line 263 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST() [27/59]

TEST	(	ListSDigraph	,
		LargeDigraph
	)

Definition at line 546 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp(), N, and nodes.

TEST() [28/59]

TEST	(	ListSDigraph	,
		MoveAssignment
	)

Definition at line 509 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST() [29/59]

TEST	(	ListSDigraph	,
		MoveConstruction
	)

Definition at line 482 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST() [30/59]

TEST	(	ListSDigraph	,
		SelfLoop
	)

Definition at line 581 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST() [31/59]

TEST	(	ListSGraph	,
		ArcIterator
	)

Definition at line 319 of file tpl_sgraph_test.cc.

References Aleph::count(), 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::sum().

TEST() [32/59]

TEST	(	ListSGraph	,
		ArcIteratorCurrentArc
	)

Definition at line 702 of file tpl_sgraph_test.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() [33/59]

TEST	(	ListSGraph	,
		ArcIteratorGetEndpoints
	)

Definition at line 387 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST() [34/59]

TEST	(	ListSGraph	,
		ComplexOperations
	)

Definition at line 719 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp(), GraphCommon< GT, Node, Arc >::esize(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::remove_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::remove_node(), and GraphCommon< GT, Node, Arc >::vsize().

TEST() [35/59]

TEST	(	ListSGraph	,
		CopyAssignment
	)

Definition at line 430 of file tpl_sgraph_test.cc.

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

TEST() [36/59]

TEST	(	ListSGraph	,
		CopyConstruction
	)

Definition at line 405 of file tpl_sgraph_test.cc.

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

TEST() [37/59]

TEST	(	ListSGraph	,
		DefaultConstruction
	)

Definition at line 160 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp(), GraphCommon< GT, Node, Arc >::esize(), GraphCommon< GT, Node, Arc >::is_digraph(), and GraphCommon< GT, Node, Arc >::vsize().

TEST() [38/59]

TEST	(	ListSGraph	,
		EmptyGraphIterators
	)

Definition at line 594 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST() [39/59]

TEST	(	ListSGraph	,
		GetFirstArcNodeThrowsWhenEmpty
	)

Definition at line 621 of file tpl_sgraph_test.cc.

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

TEST() [40/59]

TEST	(	ListSGraph	,
		GetFirstNodeArc
	)

Definition at line 609 of file tpl_sgraph_test.cc.

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

TEST() [41/59]

TEST	(	ListSGraph	,
		InsertArc
	)

Definition at line 181 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp(), GraphCommon< GT, Node, Arc >::esize(), GraphCommon< GT, Node, Arc >::get_src_node(), GraphCommon< GT, Node, Arc >::get_tgt_node(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), and Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node().

TEST() [42/59]

TEST	(	ListSGraph	,
		InsertNode
	)

Definition at line 168 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and GraphCommon< GT, Node, Arc >::vsize().

TEST() [43/59]

TEST	(	ListSGraph	,
		LargeGraph
	)

Definition at line 526 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp(), GraphCommon< GT, Node, Arc >::esize(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), N, nodes, and GraphCommon< GT, Node, Arc >::vsize().

TEST() [44/59]

TEST	(	ListSGraph	,
		MoveAssignment
	)

Definition at line 455 of file tpl_sgraph_test.cc.

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

TEST() [45/59]

TEST	(	ListSGraph	,
		MoveConstruction
	)

Definition at line 418 of file tpl_sgraph_test.cc.

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

TEST() [46/59]

TEST	(	ListSGraph	,
		MultipleArcs
	)

Definition at line 241 of file tpl_sgraph_test.cc.

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

TEST() [47/59]

TEST	(	ListSGraph	,
		NodeArcIterator
	)

Definition at line 341 of file tpl_sgraph_test.cc.

References Aleph::count(), 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::sum().

TEST() [48/59]

TEST	(	ListSGraph	,
		NodeArcIteratorCurrentArc
	)

Definition at line 689 of file tpl_sgraph_test.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() [49/59]

TEST	(	ListSGraph	,
		NodeArcIteratorGetTgtNode
	)

Definition at line 365 of file tpl_sgraph_test.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() [50/59]

TEST	(	ListSGraph	,
		NodeIterator
	)

Definition at line 300 of file tpl_sgraph_test.cc.

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

TEST() [51/59]

TEST	(	ListSGraph	,
		NodeIteratorCurrentNode
	)

Definition at line 678 of file tpl_sgraph_test.cc.

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

TEST() [52/59]

TEST	(	ListSGraph	,
		RemoveAllNodes
	)

Definition at line 629 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp(), GraphCommon< GT, Node, Arc >::esize(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::remove_node(), and GraphCommon< GT, Node, Arc >::vsize().

TEST() [53/59]

TEST	(	ListSGraph	,
		RemoveArc
	)

Definition at line 208 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp(), GraphCommon< GT, Node, Arc >::esize(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and Aleph::List_Graph< _Graph_Node, _Graph_Arc >::remove_arc().

TEST() [54/59]

TEST	(	ListSGraph	,
		RemoveNode
	)

Definition at line 222 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp(), GraphCommon< GT, Node, Arc >::esize(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::remove_node(), and GraphCommon< GT, Node, Arc >::vsize().

TEST() [55/59]

TEST	(	ListSGraph	,
		SelfAssignment
	)

Definition at line 444 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and GraphCommon< GT, Node, Arc >::vsize().

TEST() [56/59]

TEST	(	ListSGraph	,
		SelfLoop
	)

Definition at line 568 of file tpl_sgraph_test.cc.

References Aleph::divide_and_conquer_partition_dp(), GraphCommon< GT, Node, Arc >::esize(), GraphCommon< GT, Node, Arc >::get_src_node(), GraphCommon< GT, Node, Arc >::get_tgt_node(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), and Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node().

TEST() [57/59]

TEST	(	ListSGraph	,
		StringNodeInfo
	)

Definition at line 662 of file tpl_sgraph_test.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() [58/59]

TEST	(	ListSGraph	,
		SwapGraphs
	)

Definition at line 643 of file tpl_sgraph_test.cc.

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

TEST() [59/59]

TEST	(	ListSGraph	,
		UndirectedArcSymmetry
	)

Definition at line 195 of file tpl_sgraph_test.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().