Local computation graph (i.e., graph structure does not change). More...

#include <LC_InlineEdge_Graph.h>

Inheritance diagram for galois::graphs::LC_InlineEdge_Graph< NodeTy, EdgeTy, HasNoLockable, UseNumaAlloc, HasOutOfLineLockable, HasCompressedNodePtr, FileEdgeTy >:

Classes
class	NodeInfo

struct	with_compressed_node_ptr
	Compress representation of graph at the expense of one level of indirection on accessing neighbors of a node. More...

struct	with_edge_data

struct	with_file_edge_data

struct	with_id

struct	with_no_lockable

struct	with_node_data

struct	with_numa_alloc

struct	with_out_of_line_lockable

Public Types
typedef read_default_graph_tag	read_tag

typedef NodeInfo *	GraphNode

typedef EdgeTy	edge_data_type

typedef FileEdgeTy	file_edge_data_type

typedef NodeTy	node_data_type

typedef EdgeInfo::reference	edge_data_reference

typedef NodeInfoTypes::reference	node_data_reference

typedef EdgeInfo *	edge_iterator

typedef galois::NoDerefIterator < NodeInfo * >	iterator

typedef galois::NoDerefIterator< const NodeInfo * >	const_iterator

typedef iterator	local_iterator

typedef const_iterator	const_local_iterator

Public Member Functions
	~LC_InlineEdge_Graph ()

node_data_reference	getData (GraphNode N, MethodFlag mflag=MethodFlag::WRITE)

edge_data_reference	getEdgeData (edge_iterator ni, MethodFlag GALOIS_UNUSED(mflag)=MethodFlag::UNPROTECTED) const

GraphNode	getEdgeDst (edge_iterator ni) const

size_t	size () const

size_t	sizeEdges () const

const_iterator	begin () const

const_iterator	end () const

iterator	begin ()

iterator	end ()

local_iterator	local_begin ()

local_iterator	local_end ()

const_local_iterator	local_begin () const

const_local_iterator	local_end () const

edge_iterator	edge_begin (GraphNode N, MethodFlag mflag=MethodFlag::WRITE)

edge_iterator	edge_end (GraphNode N, MethodFlag mflag=MethodFlag::WRITE)

runtime::iterable < NoDerefIterator < edge_iterator > >	edges (GraphNode N, MethodFlag mflag=MethodFlag::WRITE)

runtime::iterable < NoDerefIterator < edge_iterator > >	out_edges (GraphNode N, MethodFlag mflag=MethodFlag::WRITE)

void	allocateFrom (FileGraph &graph)

void	constructFrom (FileGraph &graph, unsigned tid, unsigned total)

Protected Types
typedef internal::EdgeInfoBase < typename std::conditional < HasCompressedNodePtr, uint32_t, NodeInfo * >::type, EdgeTy >	EdgeInfo

typedef LargeArray< EdgeInfo >	EdgeData

typedef LargeArray< NodeInfo >	NodeData

typedef internal::NodeInfoBaseTypes < NodeTy,!HasNoLockable &&!HasOutOfLineLockable >	NodeInfoTypes

Protected Member Functions
template<bool C_b = HasCompressedNodePtr>
NodeInfo *	getDst (edge_iterator ii, typename std::enable_if< C_b >::type *=0) const

template<bool C_b = HasCompressedNodePtr>
NodeInfo *	getDst (edge_iterator ii, typename std::enable_if<!C_b >::type *=0) const

template<typename Container , typename Index , bool C_b = HasCompressedNodePtr>
void	setEdgeDst (Container &, edge_iterator edge, Index idx, typename std::enable_if< C_b >::type *=0)

template<typename Container , typename Index , bool C_b = HasCompressedNodePtr>
void	setEdgeDst (Container &c, edge_iterator edge, Index idx, typename std::enable_if<!C_b >::type *=0)

template<bool _A1 = HasNoLockable, bool _A2 = HasOutOfLineLockable>
void	acquireNode (GraphNode N, MethodFlag mflag, typename std::enable_if<!_A1 &&!_A2 >::type *=0)

template<bool _A1 = HasOutOfLineLockable, bool _A2 = HasNoLockable>
void	acquireNode (GraphNode N, MethodFlag mflag, typename std::enable_if< _A1 &&!_A2 >::type *=0)

template<bool _A1 = HasOutOfLineLockable, bool _A2 = HasNoLockable>
void	acquireNode (GraphNode, MethodFlag, typename std::enable_if< _A2 >::type *=0)

edge_iterator	raw_begin (GraphNode N)

edge_iterator	raw_end (GraphNode N)

template<bool _A1 = EdgeInfo::has_value, bool _A2 = LargeArray<FileEdgeTy>::has_value>
void	constructEdgeValue (FileGraph &graph, typename FileGraph::edge_iterator nn, EdgeInfo edge, typename std::enable_if<!_A1\|\|_A2 >::type =0)

template<bool _A1 = EdgeInfo::has_value, bool _A2 = LargeArray<FileEdgeTy>::has_value>
void	constructEdgeValue (FileGraph &, typename FileGraph::edge_iterator, EdgeInfo edge, typename std::enable_if< _A1 &&!_A2 >::type =0)

size_t	getId (GraphNode N)

GraphNode	getNode (size_t n)

Protected Attributes
NodeData	nodeData

EdgeData	edgeData

uint64_t	numNodes

uint64_t	numEdges

Friends
template<typename Graph >
class	LC_InOut_Graph

Detailed Description

template<typename NodeTy, typename EdgeTy, bool HasNoLockable = false, bool UseNumaAlloc = false, bool HasOutOfLineLockable = false, bool HasCompressedNodePtr = false, typename FileEdgeTy = EdgeTy>
class galois::graphs::LC_InlineEdge_Graph< NodeTy, EdgeTy, HasNoLockable, UseNumaAlloc, HasOutOfLineLockable, HasCompressedNodePtr, FileEdgeTy >

Local computation graph (i.e., graph structure does not change).

The data representation is a modification of LC_CSR_Graph where the edge data is stored inline with the adjacency information.

The position of template parameters may change between Galois releases; the most robust way to specify them is through the with_XXX nested templates.