tpl_kgraph_test.cc File Reference

Tests for tpl_kgraph.H. More...

#include <gtest/gtest.h>
#include <vector>
#include <tpl_graph.H>
#include <tpl_kgraph.H>

Include dependency graph for tpl_kgraph_test.cc:

Go to the source code of this file.

Functions
	TEST (KGraphEdgeConnectivity, EmptyGraphReturnsZero)
	TEST (KGraphEdgeConnectivity, SingleNodeReturnsZero)
	TEST (KGraphEdgeConnectivity, SingleEdgeReturnsOne)
	TEST (KGraphEdgeConnectivity, DisconnectedGraphReturnsZero)
	TEST (KGraphEdgeConnectivity, CycleReturnsTwo)
	TEST (KGraphEdgeConnectivity, CompleteGraphReturnsNMinusOne)
	TEST (KGraphEdgeConnectivity, ParallelEdgesIncreaseConnectivity)
	TEST (KGraphMinCut, EmptyGraphProducesEmptyPartition)
	TEST (KGraphMinCut, SingleNodeTrivialCut)
	TEST (KGraphMinCut, SingleEdgeCut)
	TEST (KGraphMinCut, DisconnectedGraphReturnsZero)
	TEST (KGraphMinCut, CycleReturnsTwo)
	TEST (KGraphMinCut, ParallelEdgesReturnFullCut)
	TEST (KGraphVertexConnectivity, EmptyGraphReturnsZero)
	TEST (KGraphVertexConnectivity, SingleNodeReturnsZero)
	TEST (KGraphVertexConnectivity, TwoNodesOneEdgeReturnsOne)
	TEST (KGraphVertexConnectivity, DisconnectedGraphReturnsZero)
	TEST (KGraphVertexConnectivity, CycleReturnsTwo)
	TEST (KGraphVertexConnectivity, CompleteGraphReturnsNMinusOne)
	TEST (KGraphVertexConnectivity, BowtieGraphHasConnectivityOne)
	TEST (KGraphPreconditions, RejectsDigraphs)

Detailed Description

Tests for tpl_kgraph.H.

Covers:

• edge_connectivity()
• compute_min_cut()
• vertex_connectivity()

Definition in file tpl_kgraph_test.cc.

Function Documentation

TEST() [1/21]

TEST	(	KGraphEdgeConnectivity	,
		CompleteGraphReturnsNMinusOne
	)

Definition at line 181 of file tpl_kgraph_test.cc.

References Aleph::maps(), and nodes.

TEST() [2/21]

TEST	(	KGraphEdgeConnectivity	,
		CycleReturnsTwo
	)

Definition at line 172 of file tpl_kgraph_test.cc.

References Aleph::maps(), and nodes.

TEST() [3/21]

TEST	(	KGraphEdgeConnectivity	,
		DisconnectedGraphReturnsZero
	)

Definition at line 162 of file tpl_kgraph_test.cc.

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

TEST() [4/21]

TEST	(	KGraphEdgeConnectivity	,
		EmptyGraphReturnsZero
	)

Definition at line 138 of file tpl_kgraph_test.cc.

References Aleph::maps().

TEST() [5/21]

TEST	(	KGraphEdgeConnectivity	,
		ParallelEdgesIncreaseConnectivity
	)

Definition at line 190 of file tpl_kgraph_test.cc.

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

TEST() [6/21]

TEST	(	KGraphEdgeConnectivity	,
		SingleEdgeReturnsOne
	)

Definition at line 153 of file tpl_kgraph_test.cc.

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

TEST() [7/21]

TEST	(	KGraphEdgeConnectivity	,
		SingleNodeReturnsZero
	)

Definition at line 145 of file tpl_kgraph_test.cc.

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

TEST() [8/21]

TEST	(	KGraphMinCut	,
		CycleReturnsTwo
	)

Definition at line 254 of file tpl_kgraph_test.cc.

References l, Aleph::maps(), Aleph::min_cut(), and nodes.

TEST() [9/21]

TEST	(	KGraphMinCut	,
		DisconnectedGraphReturnsZero
	)

Definition at line 239 of file tpl_kgraph_test.cc.

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

TEST() [10/21]

TEST	(	KGraphMinCut	,
		EmptyGraphProducesEmptyPartition
	)

Definition at line 200 of file tpl_kgraph_test.cc.

References l, Aleph::maps(), and Aleph::min_cut().

TEST() [11/21]

TEST	(	KGraphMinCut	,
		ParallelEdgesReturnFullCut
	)

Definition at line 268 of file tpl_kgraph_test.cc.

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

TEST() [12/21]

TEST	(	KGraphMinCut	,
		SingleEdgeCut
	)

Definition at line 225 of file tpl_kgraph_test.cc.

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

TEST() [13/21]

TEST	(	KGraphMinCut	,
		SingleNodeTrivialCut
	)

Definition at line 212 of file tpl_kgraph_test.cc.

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

TEST() [14/21]

TEST	(	KGraphPreconditions	,
		RejectsDigraphs
	)

Definition at line 350 of file tpl_kgraph_test.cc.

References l, and Aleph::maps().

TEST() [15/21]

TEST	(	KGraphVertexConnectivity	,
		BowtieGraphHasConnectivityOne
	)

Definition at line 335 of file tpl_kgraph_test.cc.

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

TEST() [16/21]

TEST	(	KGraphVertexConnectivity	,
		CompleteGraphReturnsNMinusOne
	)

Definition at line 326 of file tpl_kgraph_test.cc.

References Aleph::maps(), and nodes.

TEST() [17/21]

TEST	(	KGraphVertexConnectivity	,
		CycleReturnsTwo
	)

Definition at line 317 of file tpl_kgraph_test.cc.

References Aleph::maps(), and nodes.

TEST() [18/21]

TEST	(	KGraphVertexConnectivity	,
		DisconnectedGraphReturnsZero
	)

Definition at line 307 of file tpl_kgraph_test.cc.

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

TEST() [19/21]

TEST	(	KGraphVertexConnectivity	,
		EmptyGraphReturnsZero
	)

Definition at line 283 of file tpl_kgraph_test.cc.

References Aleph::maps().

TEST() [20/21]

TEST	(	KGraphVertexConnectivity	,
		SingleNodeReturnsZero
	)

Definition at line 290 of file tpl_kgraph_test.cc.

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

TEST() [21/21]

TEST	(	KGraphVertexConnectivity	,
		TwoNodesOneEdgeReturnsOne
	)

Definition at line 298 of file tpl_kgraph_test.cc.

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