Galois::Graph Namespace Reference

Parallel graph data structures. More...

Namespaces
namespace	GraphImpl
namespace	LCGraphImpl
Classes
class	FileGraph
	Graph serialized to a file. More...
class	FileGraphParser
	Simplifies parsing graphs from files. More...
class	LC_FileGraph
	Local computation graph (i.e., graph structure does not change) THIS GRAPH SHOULD GO AWAY. More...
class	LC_FileGraph< void, EdgeTy >
	Local computation graph (i.e., graph structure does not change). More...
class	LC_FileGraph< NodeTy, void >
class	LC_FileGraph< void, void >
class	FirstGraph
	A Graph. More...
class	LC_CSR_Graph
	Local computation graph (i.e., graph structure does not change). More...
class	LC_CSRInline_Graph
	Local computation graph (i.e., graph structure does not change). More...
class	LC_Linear_Graph
	Local computation graph (i.e., graph structure does not change). More...
class	LC_Numa_Graph
	Local computation graph (i.e., graph structure does not change) Specialization of LC_Linear_Graph for NUMA architectures. More...
struct	CompareNodeData
class	SpatialTree2d
	Stores sets of objects at specific spatial coordinates in a quad tree. More...
Functions
template<typename EdgeTy >
void	makeSymmetric (FileGraph &in, FileGraph &out)
	Adds reverse edges to a graph.
template<typename Graph >
bool	outputGraph (const char *file, Graph &G)
	Writes graph out to binary file.
template<typename Graph >
bool	outputTextEdgeData (const char *ofile, Graph &G)
	Writes graph out to an ASCII file.

---

Detailed Description

Parallel graph data structures.

---

Function Documentation

template<typename EdgeTy >

void Galois::Graph::makeSymmetric	(	FileGraph &	in,
		FileGraph &	out
	)			[inline]

Adds reverse edges to a graph.

Reverse edges have edge data copied from the original edge. New graph is placed in out parameter. The previous graph in out is destroyed.

template<typename Graph >

bool Galois::Graph::outputGraph	(	const char *	file,
		Graph &	G
	)			[inline]

Writes graph out to binary file.

Does not currently save node data. Tries to make output node ids independent of graph iteration order by sorting Graph::GraphNodes using NodeData::operator<() first, so if you want nodes to appear in certain order set the node data appropriately.

template<typename Graph >

bool Galois::Graph::outputTextEdgeData	(	const char *	ofile,
		Graph &	G
	)			[inline]

Writes graph out to an ASCII file.