Graph

Classes
struct	Grappa::Empty
	Empty struct, for specifying lack of either Vertex or Edge data in Graph. More...
struct	Grappa::Graph< V, E >::Edge
struct	Grappa::Graph< V, E >
	Distributed graph data structure, with customizable vertex and edge data. More...
struct	Grappa::AdjIterator< G >

Macros
#define	OVERLOAD(...)

Typedefs
using	Grappa::VertexID = int64_t
	Currently just an overload for int64, may someday be used for distinguishing parameters in forall(). More...

Functions
template<typename G >
AdjIterator< G >	Grappa::adj (GlobalAddress< G > g, typename G::Vertex &v)
	Iterator over adjacent vertices. Used with Grappa::forall(). More...
template<typename G >
AdjIterator< G >	Grappa::adj (GlobalAddress< G > g, GlobalAddress< typename G::Vertex > v)
template<typename G >
AdjIterator< G >	Grappa::adj (GlobalAddress< G > g, VertexID i)
	Grappa::OVERLOAD (SyncMode S=SyncMode::Blocking, GlobalCompletionEvent *C=&impl::local_gce, int64_t Threshold=impl::USE_LOOP_THRESHOLD_FLAG)
	Parallel loop over adjacent vertices. Use adj() to construct iterator. More...
	Grappa::OVERLOAD (GlobalCompletionEvent *C, SyncMode S=SyncMode::Blocking, int64_t Threshold=impl::USE_LOOP_THRESHOLD_FLAG)
template<typename G = nullptr_t, typename F = nullptr_t>
void	Grappa::serial_for (AdjIterator< G > a, F body)
template<GlobalCompletionEvent * C = &impl::local_gce, int64_t Threshold = impl::USE_LOOP_THRESHOLD_FLAG, typename V , typename E , typename F = nullptr_t>
void	Grappa::forall (GlobalAddress< Graph< V, E >> g, F loop_body)
	Parallel iterator over Graph, specializes based on arguments. More...
static GlobalAddress< Graph >	Grappa::Graph< V, E >::create (const TupleGraph &tg, bool directed=false, bool solo_invalid=true)
	Construct a distributed adjacency-list Graph. More...

Detailed Description

Macro Definition Documentation

#define OVERLOAD

(

...

)

Value:

template< __VA_ARGS__, typename G = nullptr_t, typename F = nullptr_t > \
  void forall(AdjIterator<G> a, F body) { \
    impl::forall<S,C,Threshold>(a, body, &F::operator()); \
  }

Definition at line 459 of file Graph.hpp.

Typedef Documentation

using Grappa::VertexID = typedef int64_t

Currently just an overload for int64, may someday be used for distinguishing parameters in forall().

Definition at line 61 of file Graph.hpp.

Function Documentation

template<typename G >

AdjIterator<G> Grappa::adj	(	GlobalAddress< G >	g,
		typename G::Vertex &	v
	)

Iterator over adjacent vertices. Used with Grappa::forall().

Definition at line 398 of file Graph.hpp.

template<typename G >

AdjIterator<G> Grappa::adj	(	GlobalAddress< G >	g,
		GlobalAddress< typename G::Vertex >	v
	)

Definition at line 403 of file Graph.hpp.

template<typename G >

AdjIterator<G> Grappa::adj	(	GlobalAddress< G >	g,
		VertexID	i
	)

Definition at line 408 of file Graph.hpp.

template<typename V , typename E >

GlobalAddress< Graph< V, E > > Grappa::Graph< V, E >::create ( const TupleGraph< V, E > &  tg, bool  directed = false, bool  solo_invalid = true  )

static

Construct a distributed adjacency-list Graph.

Returns

The symmetric address to the 'proxy' allocated on each core, which has the size information and a portion of the graph.

Parameters

tg	input edges
directed	create additional edges to make it undirected
solo_invalid	mark vertices with no in- or out-edges as invalid (not to be visited when iterating over vertices)

Definition at line 620 of file Graph.hpp.

template<GlobalCompletionEvent * C = &impl::local_gce, int64_t Threshold = impl::USE_LOOP_THRESHOLD_FLAG, typename V , typename E , typename F = nullptr_t>

void Grappa::forall	(	GlobalAddress< Graph< V, E >>	g,
		F	loop_body
	)

Parallel iterator over Graph, specializes based on arguments.

See Graph overview page for details.

Definition at line 566 of file Graph.hpp.

Grappa::OVERLOAD	(	SyncMode	S = SyncMode::Blocking,
		GlobalCompletionEvent *	C = &impl::local_gce,
		int64_t	Threshold = impl::USE_LOOP_THRESHOLD_FLAG
	)

Parallel loop over adjacent vertices. Use adj() to construct iterator.

Grappa::OVERLOAD	(	GlobalCompletionEvent *	C,
		SyncMode	S = SyncMode::Blocking,
		int64_t	Threshold = impl::USE_LOOP_THRESHOLD_FLAG
	)

template<typename G = nullptr_t, typename F = nullptr_t>

void Grappa::serial_for	(	AdjIterator< G >	a,
		F	body
	)

Definition at line 474 of file Graph.hpp.