Aleph_Test_Helpers Namespace Reference

Classes
struct	Positive_Arc_Filter

Functions
template<class GT >
Aleph::Array< typename GT::Node * >	build_graph_with_unit_arcs (GT &g, const size_t n, const std::vector< std::pair< size_t, size_t > > &edges)
template<class GT >
Aleph::Array< typename GT::Node * >	build_graph_with_unit_arcs (GT &g, const size_t n, const std::initializer_list< std::pair< size_t, size_t > > &edges)
template<class GT >
Aleph::Array< typename GT::Node * >	build_graph_with_unit_arcs (GT &g, const size_t n, const Aleph::Array< std::pair< size_t, size_t > > &edges)
template<class EdgeContainer >
EdgeContainer	make_random_tree_edges (const size_t n, std::mt19937 &rng)

Function Documentation

build_graph_with_unit_arcs() [1/3]

template<class GT >

Aleph::Array< typename GT::Node * > Aleph_Test_Helpers::build_graph_with_unit_arcs	(	GT &	g,
		const size_t	n,
		const Aleph::Array< std::pair< size_t, size_t > > &	edges
	)

Definition at line 79 of file test_graph_helpers.h.

References build_graph_with_unit_arcs(), 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(), and nodes.

build_graph_with_unit_arcs() [2/3]

template<class GT >

Aleph::Array< typename GT::Node * > Aleph_Test_Helpers::build_graph_with_unit_arcs	(	GT &	g,
		const size_t	n,
		const std::initializer_list< std::pair< size_t, size_t > > &	edges
	)

Definition at line 68 of file test_graph_helpers.h.

References build_graph_with_unit_arcs().

build_graph_with_unit_arcs() [3/3]

template<class GT >

Aleph::Array< typename GT::Node * > Aleph_Test_Helpers::build_graph_with_unit_arcs	(	GT &	g,
		const size_t	n,
		const std::vector< std::pair< size_t, size_t > > &	edges
	)

Definition at line 46 of file test_graph_helpers.h.

References build_graph_with_unit_arcs(), 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(), and nodes.

Referenced by build_graph_with_unit_arcs(), build_graph_with_unit_arcs(), and build_graph_with_unit_arcs().

make_random_tree_edges()

template<class EdgeContainer >

EdgeContainer Aleph_Test_Helpers::make_random_tree_edges	(	const size_t	n,
		std::mt19937 &	rng
	)

Definition at line 113 of file test_graph_helpers.h.

References Aleph::divide_and_conquer_partition_dp(), make_random_tree_edges(), and rng.

Referenced by make_random_tree_edges().