A wrapper for implementing a linear partition of vertices on graphs. More...

#include <for_each.h>

Inheritance diagram for ibmppl::graph_linear_task_partitioner< G >:

Public Member Functions
	graph_linear_task_partitioner (G &g, PARTITION_TYPE ptype, size_t chunk_size)

Public Member Functions inherited from ibmppl::linear_task_partitioner< graph_vertex_iterator< G > >
	linear_task_partitioner (graph_vertex_iterator< G > &data, PARTITION_TYPE ptype, size_t chunk_size)

	linear_task_partitioner ()

size_t	num_partitions ()

iterator	partition_begin (task_id chunk_id)

iterator	partition_end (task_id chunk_id)

Protected Attributes
graph_vertex_iterator< G >	_graph_iterator

Protected Attributes inherited from ibmppl::linear_task_partitioner< graph_vertex_iterator< G > >
size_t	_chunk_size

size_t	_num_chunks

size_t	_total_size

PARTITION_TYPE	_ptype

graph_vertex_iterator< G > *	_data

Private Types
typedef linear_task_partitioner < graph_vertex_iterator< G > >	base_type

Additional Inherited Members
Public Types inherited from ibmppl::linear_task_partitioner< graph_vertex_iterator< G > >
typedef graph_vertex_iterator < G >::iterator	iterator

typedef graph_vertex_iterator < G >::const_iterator	const_iterator

Protected Member Functions inherited from ibmppl::linear_task_partitioner< graph_vertex_iterator< G > >
void	setData (graph_vertex_iterator< G > *data)

void	init (PARTITION_TYPE ptype, size_t chunk_size)

Detailed Description

A wrapper for implementing a linear partition of vertices on graphs.

Constructor & Destructor Documentation

template<class G >

ibmppl::graph_linear_task_partitioner< G >::graph_linear_task_partitioner	(	G &	g,
		PARTITION_TYPE	ptype,
		size_t	chunk_size
	)

inline

constructor: to build a linear partitioner of graphs by vertices

The documentation for this class was generated from the following file: