cut_nodes_test.cc File Reference

Tests for Cut Nodes. More...

#include <gtest/gtest.h>
#include <initializer_list>
#include <tpl_array.H>
#include <tpl_cut_nodes.H>
#include <tpl_dynSetTree.H>
#include <tpl_graph.H>
#include <tpl_graph_utils.H>

Include dependency graph for cut_nodes_test.cc:

Go to the source code of this file.

Functions
	TEST (CutNodes, PathGraphHasInternalCutNodes)
	TEST (CutNodes, CycleGraphHasNoCutNodes)
	TEST (CutNodes, StarGraphHasCenterAsCutNode)
	TEST (CutNodes, PaintSubgraphsRequiresCutNodesComputed)
	TEST (CutNodes, PaintSubgraphsAndMapCutGraphOnStar)
	TEST (CutNodes, MapSubgraphMatchesColorCounts)
	TEST (CutNodes, MapCutGraphMatchesCutArcCountOnPath)
	TEST (CutNodes, CompleteGraphHasNoCutNodes)
	TEST (CutNodes, TreeAllInternalNodesAreCutNodes)
	TEST (CutNodes, BridgeGraphHasMultipleCutNodes)
	TEST (CutNodes, BiconnectedGraphHasNoCutNodes)
	TEST (CutNodes, ArticulationAtRootNode)
	TEST (CutNodes, MapSubgraphWithoutPaintingThrows)
	TEST (CutNodes, MapCutGraphWithoutPaintingThrows)
	TEST (CutNodes, CorrectSequenceCutNodesPaintMap)
	TEST (CutNodes, MultipleCutNodesCallsReinitialize)
	TEST (CutNodes, OperatorWithoutStartUsesFirstNode)
	TEST (CutNodes, OperatorWithSpecificStart)
	TEST (CutNodes, PaintAssignsCorrectColors)
	TEST (CutNodes, CrossArcsIdentifiedCorrectly)
	TEST (CutNodes, CutArcsIdentifiedInBridge)
	TEST (CutNodes, NumberOfColorsMatchesComponents)
	TEST (CutNodes, MapSubgraphWithInvalidColorThrows)
	TEST (CutNodes, MappedSubgraphIsCorrect)
	TEST (CutNodes, BidirectionalMappingEstablished)
	TEST (CutNodes, CutGraphContainsOnlyCutNodes)
	TEST (CutNodes, CrossArcsListMatchesGraph)
	TEST (CutNodes, ComputeBlocksWithoutCutNodesThrows)
	TEST (CutNodes, ComputeBlocksAutoPaints)
	TEST (CutNodes, ComputeBlocksGeneratesAllBlocks)
	TEST (CutNodes, ComputeBlocksGeneratesCutGraph)
	TEST (CutNodes, ComputeBlocksGeneratesCrossArcList)
	TEST (CutNodes, SingleNodeHasNoCutNodes)
	TEST (CutNodes, TwoNodesWithArcNoCutNodes)
	TEST (CutNodes, TriangleNoCutNodes)
	TEST (CutNodes, SelfLoopDoesNotAffectCutNodes)
	TEST (CutNodes, ParallelArcsDoNotAffectCutNodes)
	TEST (CutNodes, CompleteWorkflowDetectPaintMapAll)
	TEST (CutNodes, MultipleIterationsOnSameGraph)
	TEST (CutNodes, LargeGraphStressTest)
	TEST (CutNodes, ExceptionDuringMapSubgraphClearsGraph)
	TEST (Bridges, PathGraphAllEdgesAreBridges)
	TEST (Bridges, CycleHasNoBridges)
	TEST (Bridges, TwoTrianglesOneBridge)
	TEST (Bridges, TreeAllEdgesAreBridges)
	TEST (Bridges, CompleteK4NoBridges)
	TEST (Bridges, SingleNodeNoBridges)
	TEST (Bridges, TwoNodesOneBridge)
	TEST (Bridges, ParallelArcsNotBridges)
	TEST (Bridges, FreeFunctionConsistentWithClass)
	TEST (Bridges, OperatorCallConsistentWithMethod)
	TEST (Bridges, MultipleCallsSameResult)
	TEST (Bridges, StressTestPathGraph)
	TEST (Bridges, ConsistentWithCutArcOnPathGraph)
	TEST (Bridges, StarGraphAllEdgesBridges)
	TEST (Bridges, SelfLoopDoesNotAffectBridges)
	TEST (Bridges, ResultIsIndependentOfStartNode)
	TEST (Bridges, NonBridgeEdgesAbsentFromList)
	TEST (Bridges, EmptyGraphNoArgReturnsEmpty)
	TEST (Bridges, DisconnectedGraphBridgesFromAllComponents)

Detailed Description

Tests for Cut Nodes.

Definition in file cut_nodes_test.cc.

Function Documentation

TEST() [1/60]

TEST	(	Bridges	,
		CompleteK4NoBridges
	)

Definition at line 1039 of file cut_nodes_test.cc.

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

TEST() [2/60]

TEST	(	Bridges	,
		ConsistentWithCutArcOnPathGraph
	)

Definition at line 1151 of file cut_nodes_test.cc.

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

TEST() [3/60]

TEST	(	Bridges	,
		CycleHasNoBridges
	)

Definition at line 982 of file cut_nodes_test.cc.

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

TEST() [4/60]

TEST	(	Bridges	,
		DisconnectedGraphBridgesFromAllComponents
	)

Definition at line 1253 of file cut_nodes_test.cc.

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

TEST() [5/60]

TEST	(	Bridges	,
		EmptyGraphNoArgReturnsEmpty
	)

Definition at line 1246 of file cut_nodes_test.cc.

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

TEST() [6/60]

TEST	(	Bridges	,
		FreeFunctionConsistentWithClass
	)

Definition at line 1082 of file cut_nodes_test.cc.

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

TEST() [7/60]

TEST	(	Bridges	,
		MultipleCallsSameResult
	)

Definition at line 1117 of file cut_nodes_test.cc.

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

TEST() [8/60]

TEST	(	Bridges	,
		NonBridgeEdgesAbsentFromList
	)

Definition at line 1225 of file cut_nodes_test.cc.

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

TEST() [9/60]

TEST	(	Bridges	,
		OperatorCallConsistentWithMethod
	)

Definition at line 1101 of file cut_nodes_test.cc.

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

TEST() [10/60]

TEST	(	Bridges	,
		ParallelArcsNotBridges
	)

Definition at line 1070 of file cut_nodes_test.cc.

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

TEST() [11/60]

TEST	(	Bridges	,
		PathGraphAllEdgesAreBridges
	)

Definition at line 963 of file cut_nodes_test.cc.

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

TEST() [12/60]

TEST	(	Bridges	,
		ResultIsIndependentOfStartNode
	)

Definition at line 1202 of file cut_nodes_test.cc.

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

TEST() [13/60]

TEST	(	Bridges	,
		SelfLoopDoesNotAffectBridges
	)

Definition at line 1186 of file cut_nodes_test.cc.

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

TEST() [14/60]

TEST	(	Bridges	,
		SingleNodeNoBridges
	)

Definition at line 1051 of file cut_nodes_test.cc.

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

TEST() [15/60]

TEST	(	Bridges	,
		StarGraphAllEdgesBridges
	)

Definition at line 1171 of file cut_nodes_test.cc.

References Aleph::DynList< T >::append(), arcs, Aleph::divide_and_conquer_partition_dp(), Aleph::find_bridges(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), and nodes.

TEST() [16/60]

TEST	(	Bridges	,
		StressTestPathGraph
	)

Definition at line 1138 of file cut_nodes_test.cc.

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

TEST() [17/60]

TEST	(	Bridges	,
		TreeAllEdgesAreBridges
	)

Definition at line 1014 of file cut_nodes_test.cc.

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

TEST() [18/60]

TEST	(	Bridges	,
		TwoNodesOneBridge
	)

Definition at line 1059 of file cut_nodes_test.cc.

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

TEST() [19/60]

TEST	(	Bridges	,
		TwoTrianglesOneBridge
	)

Definition at line 996 of file cut_nodes_test.cc.

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

TEST() [20/60]

TEST	(	CutNodes	,
		ArticulationAtRootNode
	)

Definition at line 331 of file cut_nodes_test.cc.

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

TEST() [21/60]

TEST	(	CutNodes	,
		BiconnectedGraphHasNoCutNodes
	)

Definition at line 314 of file cut_nodes_test.cc.

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

TEST() [22/60]

TEST	(	CutNodes	,
		BidirectionalMappingEstablished
	)

Definition at line 602 of file cut_nodes_test.cc.

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

TEST() [23/60]

TEST	(	CutNodes	,
		BridgeGraphHasMultipleCutNodes
	)

Definition at line 294 of file cut_nodes_test.cc.

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

TEST() [24/60]

TEST	(	CutNodes	,
		CompleteGraphHasNoCutNodes
	)

Definition at line 253 of file cut_nodes_test.cc.

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

TEST() [25/60]

TEST	(	CutNodes	,
		CompleteWorkflowDetectPaintMapAll
	)

Definition at line 856 of file cut_nodes_test.cc.

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

TEST() [26/60]

TEST	(	CutNodes	,
		ComputeBlocksAutoPaints
	)

Definition at line 695 of file cut_nodes_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), nodes, and Aleph::DynDlist< T >::size().

TEST() [27/60]

TEST	(	CutNodes	,
		ComputeBlocksGeneratesAllBlocks
	)

Definition at line 715 of file cut_nodes_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), nodes, and Aleph::DynDlist< T >::size().

TEST() [28/60]

TEST	(	CutNodes	,
		ComputeBlocksGeneratesCrossArcList
	)

Definition at line 759 of file cut_nodes_test.cc.

References Aleph::divide_and_conquer_partition_dp(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::Dlink::is_empty(), and nodes.

TEST() [29/60]

TEST	(	CutNodes	,
		ComputeBlocksGeneratesCutGraph
	)

Definition at line 738 of file cut_nodes_test.cc.

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

TEST() [30/60]

TEST	(	CutNodes	,
		ComputeBlocksWithoutCutNodesThrows
	)

Definition at line 680 of file cut_nodes_test.cc.

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

TEST() [31/60]

TEST	(	CutNodes	,
		CorrectSequenceCutNodesPaintMap
	)

Definition at line 386 of file cut_nodes_test.cc.

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

TEST() [32/60]

TEST	(	CutNodes	,
		CrossArcsIdentifiedCorrectly
	)

Definition at line 496 of file cut_nodes_test.cc.

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

TEST() [33/60]

TEST	(	CutNodes	,
		CrossArcsListMatchesGraph
	)

Definition at line 651 of file cut_nodes_test.cc.

References Aleph::divide_and_conquer_partition_dp(), GraphCommon< GT, Node, Arc >::get_arc_it(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), nodes, and Aleph::DynDlist< T >::size().

TEST() [34/60]

TEST	(	CutNodes	,
		CutArcsIdentifiedInBridge
	)

Definition at line 517 of file cut_nodes_test.cc.

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

TEST() [35/60]

TEST	(	CutNodes	,
		CutGraphContainsOnlyCutNodes
	)

Definition at line 630 of file cut_nodes_test.cc.

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

TEST() [36/60]

TEST	(	CutNodes	,
		CycleGraphHasNoCutNodes
	)

Definition at line 131 of file cut_nodes_test.cc.

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

TEST() [37/60]

TEST	(	CutNodes	,
		ExceptionDuringMapSubgraphClearsGraph
	)

Definition at line 922 of file cut_nodes_test.cc.

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

TEST() [38/60]

TEST	(	CutNodes	,
		LargeGraphStressTest
	)

Definition at line 905 of file cut_nodes_test.cc.

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

TEST() [39/60]

TEST	(	CutNodes	,
		MapCutGraphMatchesCutArcCountOnPath
	)

Definition at line 228 of file cut_nodes_test.cc.

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

TEST() [40/60]

TEST	(	CutNodes	,
		MapCutGraphWithoutPaintingThrows
	)

Definition at line 371 of file cut_nodes_test.cc.

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

TEST() [41/60]

TEST	(	CutNodes	,
		MappedSubgraphIsCorrect
	)

Definition at line 579 of file cut_nodes_test.cc.

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

TEST() [42/60]

TEST	(	CutNodes	,
		MapSubgraphMatchesColorCounts
	)

Definition at line 205 of file cut_nodes_test.cc.

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

TEST() [43/60]

TEST	(	CutNodes	,
		MapSubgraphWithInvalidColorThrows
	)

Definition at line 564 of file cut_nodes_test.cc.

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

TEST() [44/60]

TEST	(	CutNodes	,
		MapSubgraphWithoutPaintingThrows
	)

Definition at line 357 of file cut_nodes_test.cc.

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

TEST() [45/60]

TEST	(	CutNodes	,
		MultipleCutNodesCallsReinitialize
	)

Definition at line 409 of file cut_nodes_test.cc.

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

TEST() [46/60]

TEST	(	CutNodes	,
		MultipleIterationsOnSameGraph
	)

Definition at line 887 of file cut_nodes_test.cc.

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

TEST() [47/60]

TEST	(	CutNodes	,
		NumberOfColorsMatchesComponents
	)

Definition at line 538 of file cut_nodes_test.cc.

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

TEST() [48/60]

TEST	(	CutNodes	,
		OperatorWithoutStartUsesFirstNode
	)

Definition at line 433 of file cut_nodes_test.cc.

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

TEST() [49/60]

TEST	(	CutNodes	,
		OperatorWithSpecificStart
	)

Definition at line 448 of file cut_nodes_test.cc.

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

TEST() [50/60]

TEST	(	CutNodes	,
		PaintAssignsCorrectColors
	)

Definition at line 467 of file cut_nodes_test.cc.

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

TEST() [51/60]

TEST	(	CutNodes	,
		PaintSubgraphsAndMapCutGraphOnStar
	)

Definition at line 174 of file cut_nodes_test.cc.

References Aleph::divide_and_conquer_partition_dp(), GraphCommon< GT, Node, Arc >::get_num_arcs(), Aleph::Dlink::Iterator::has_curr(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), nodes, and Aleph::DynDlist< T >::size().

TEST() [52/60]

TEST	(	CutNodes	,
		PaintSubgraphsRequiresCutNodesComputed
	)

Definition at line 162 of file cut_nodes_test.cc.

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

TEST() [53/60]

TEST	(	CutNodes	,
		ParallelArcsDoNotAffectCutNodes
	)

Definition at line 837 of file cut_nodes_test.cc.

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

TEST() [54/60]

TEST	(	CutNodes	,
		PathGraphHasInternalCutNodes
	)

Definition at line 116 of file cut_nodes_test.cc.

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

TEST() [55/60]

TEST	(	CutNodes	,
		SelfLoopDoesNotAffectCutNodes
	)

Definition at line 822 of file cut_nodes_test.cc.

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

TEST() [56/60]

TEST	(	CutNodes	,
		SingleNodeHasNoCutNodes
	)

Definition at line 782 of file cut_nodes_test.cc.

References Aleph::divide_and_conquer_partition_dp(), and nodes.

TEST() [57/60]

TEST	(	CutNodes	,
		StarGraphHasCenterAsCutNode
	)

Definition at line 147 of file cut_nodes_test.cc.

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

TEST() [58/60]

TEST	(	CutNodes	,
		TreeAllInternalNodesAreCutNodes
	)

Definition at line 269 of file cut_nodes_test.cc.

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

TEST() [59/60]

TEST	(	CutNodes	,
		TriangleNoCutNodes
	)

Definition at line 807 of file cut_nodes_test.cc.

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

TEST() [60/60]

TEST	(	CutNodes	,
		TwoNodesWithArcNoCutNodes
	)

Definition at line 794 of file cut_nodes_test.cc.

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