Galois::Graph::FileGraph Class Reference

Graph serialized to a file. More...

#include <FileGraph.h>

Inheritance diagram for Galois::Graph::FileGraph:

List of all members.

Public Types
typedef uint32_t	GraphNode
typedef uint32_t *	neighbor_iterator
typedef boost::counting_iterator < uint64_t >	active_iterator
Public Member Functions
bool	containsNode (const GraphNode n)
	Check if a node is in the graph (already added).
template<typename EdgeTy >
EdgeTy &	getEdgeData (GraphNode src, GraphNode dst, MethodFlag mflag=ALL)
void	prefetch_edges (GraphNode N)
template<typename EdgeTy >
void	prefetch_edgedata (GraphNode N)
void	prefetch_pre (GraphNode N)
neighbor_iterator	neighbor_begin (GraphNode N, MethodFlag mflag=ALL)
neighbor_iterator	neighbor_end (GraphNode N, MethodFlag mflag=ALL)
bool	has_neighbor (GraphNode N1, GraphNode N2, MethodFlag mflag=ALL)
active_iterator	active_begin ()
	Iterate over nodes in graph (not thread safe).
active_iterator	active_end ()
unsigned int	size ()
	The number of nodes in the graph.
	FileGraph ()
	~FileGraph ()
bool	structureFromFile (const char *filename)
	Read graph connectivity information from file.
Protected Member Functions
uint64_t	getEdgeIdx (GraphNode src, GraphNode dst)
Protected Attributes
void *	masterMapping
size_t	masterLength
uint64_t	sizeEdgeTy
int	masterFD
uint64_t *	outIdx
uint32_t *	outs
char *	edgeData
uint64_t	numEdges
uint64_t	numNodes

---

Detailed Description

Graph serialized to a file.

---

Member Typedef Documentation

typedef boost::counting_iterator<uint64_t> Galois::Graph::FileGraph::active_iterator

typedef uint32_t Galois::Graph::FileGraph::GraphNode

typedef uint32_t* Galois::Graph::FileGraph::neighbor_iterator

---

Constructor & Destructor Documentation

FileGraph::FileGraph

(

)

FileGraph::~FileGraph

(

)

---

Member Function Documentation

active_iterator Galois::Graph::FileGraph::active_begin

(

)

[inline]

Iterate over nodes in graph (not thread safe).

active_iterator Galois::Graph::FileGraph::active_end

(

)

[inline]

bool Galois::Graph::FileGraph::containsNode

(

const GraphNode

n

)

[inline]

Check if a node is in the graph (already added).

template<typename EdgeTy >

EdgeTy& Galois::Graph::FileGraph::getEdgeData	(	GraphNode	src,
		GraphNode	dst,
		MethodFlag	mflag = ALL
	)			[inline]

Reimplemented in Galois::Graph::LC_FileGraph< NodeTy, EdgeTy >.

uint64_t Galois::Graph::FileGraph::getEdgeIdx	(	GraphNode	src,
		GraphNode	dst
	)			[inline, protected]

bool Galois::Graph::FileGraph::has_neighbor	(	GraphNode	N1,
		GraphNode	N2,
		MethodFlag	mflag = ALL
	)			[inline]

neighbor_iterator Galois::Graph::FileGraph::neighbor_begin	(	GraphNode	N,
		MethodFlag	mflag = ALL
	)			[inline]

neighbor_iterator Galois::Graph::FileGraph::neighbor_end	(	GraphNode	N,
		MethodFlag	mflag = ALL
	)			[inline]

template<typename EdgeTy >

void Galois::Graph::FileGraph::prefetch_edgedata

(

GraphNode

N

)

[inline]

Reimplemented in Galois::Graph::LC_FileGraph< NodeTy, EdgeTy >.

void Galois::Graph::FileGraph::prefetch_edges

(

GraphNode

N

)

[inline]

void Galois::Graph::FileGraph::prefetch_pre

(

GraphNode

N

)

[inline]

unsigned int Galois::Graph::FileGraph::size

(

)

[inline]

The number of nodes in the graph.

bool FileGraph::structureFromFile

(

const char *

filename

)

Read graph connectivity information from file.

---

Member Data Documentation

char* Galois::Graph::FileGraph::edgeData [protected]

int Galois::Graph::FileGraph::masterFD [protected]

size_t Galois::Graph::FileGraph::masterLength [protected]

void* Galois::Graph::FileGraph::masterMapping [protected]

uint64_t Galois::Graph::FileGraph::numEdges [protected]

uint64_t Galois::Graph::FileGraph::numNodes [protected]

uint64_t* Galois::Graph::FileGraph::outIdx [protected]

uint32_t* Galois::Graph::FileGraph::outs [protected]

uint64_t Galois::Graph::FileGraph::sizeEdgeTy [protected]

---

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

• FileGraph.h
• FileGraph.cpp