sst/elements/genericProc/programs/MTGL/test/test_connected_components.cpp File Reference

#include <list>
#include "mtgl_test.hpp"
#include <mtgl/util.hpp>
#include <mtgl/static_graph_adapter.hpp>
#include <mtgl/breadth_first_search.hpp>
#include <mtgl/connected_components.hpp>
#include <mtgl/edge_array_adapter.hpp>
#include <mtgl/mtgl_boost_property.hpp>
#include <mtgl/metrics.hpp>
#include <map>

Functions
template<class graph_adapter >
void	print_component_dimacs (graph_adapter &ga, int *result)
double	get_freq ()
template<class T , class T2 >
void	init_array (T *a, T2 size)
template<class T , class T2 >
void	init_array2 (T *a, T2 size)
template<typename graph , typename inttype >
void	test_connected_components_kahan (graph &g, inttype *result)
template<typename graph , class uinttype >
void	test_connected_components_simple (graph &g, uinttype *result)
template<typename graph >
void	test_connected_components_sv (graph &g, typename graph_traits< graph >::vertex_descriptor *result)
template<typename graph_adapter >
void	test_connected_components_foo_sv (graph_adapter &g, typename graph_traits< graph_adapter >::vertex_descriptor *result)
template<class uinttype , typename graph_adapter >
void	run_algorithm (kernel_test_info &kti, graph_adapter &ga)
int	main (int argc, char *argv[])
template<class graph >
int	find_biggest_component (graph &g, int *result)

---

Detailed Description

Author:

Jon Berry ([email protected])

Date:

12/4/2007