Boruvka.cpp File Reference

Boruvka application -*- C++ -*-. More...

#include "Galois/Statistic.h"
#include "Galois/Graphs/Graph.h"
#include "Galois/Timer.h"
#include "Galois/Galois.h"
#include "Galois/Graphs/Serialize.h"
#include "Galois/Graphs/FileGraph.h"
#include "Lonestar/Banner.h"
#include "Lonestar/CommandLine.h"
#include <string>
#include <sstream>
#include <limits>
#include <iostream>
#include <fstream>
#include <set>

Classes
struct	Node
struct	process
Defines
#define	BORUVKA_DEBUG   0
Typedefs
typedef Galois::Graph::FirstGraph < Node, int, false >	Graph
typedef Graph::GraphNode	GNode
Functions
void	printGraph ()
void	runBodyParallel ()
static void	makeGraph (const char *input)
int	main (int argc, const char **argv)
Variables
static const char *	name = "Boruvka MST"
static const char *	description = "Computes the Minimal Spanning Tree using Boruvka\n"
static const char *	url = "boruvkas_algorithm"
static const char *	help = "<input file> "
static unsigned int	nodeID = 0
Graph	graph
std::vector< GNode >	nodes
GaloisRuntime::PerCPU < unsigned int >	MSTWeight

---

Detailed Description

Boruvka application -*- C++ -*-.

License

Galois, a framework to exploit amorphous data-parallelism in irregular programs.

Copyright (C) 2011, The University of Texas at Austin. All rights reserved. UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS SOFTWARE AND DOCUMENTATION, INCLUDING ANY WARRANTIES OF MERCHANTABILITY, FITNESS FOR ANY PARTICULAR PURPOSE, NON-INFRINGEMENT AND WARRANTIES OF PERFORMANCE, AND ANY WARRANTY THAT MIGHT OTHERWISE ARISE FROM COURSE OF DEALING OR USAGE OF TRADE. NO WARRANTY IS EITHER EXPRESS OR IMPLIED WITH RESPECT TO THE USE OF THE SOFTWARE OR DOCUMENTATION. Under no circumstances shall University be liable for incidental, special, indirect, direct or consequential damages or loss of profits, interruption of business, or related expenses which may arise from use of Software or Documentation, including but not limited to those resulting from defects in Software and/or Documentation, or loss or inaccuracy of data of any kind.

Author:

Donald Nguyen <ddn@cs.utexas.edu>

Rashid Kaleem <rashid@cs.utexas.edu>

---

Define Documentation

#define BORUVKA_DEBUG   0

---

Typedef Documentation

typedef Graph::GraphNode GNode

typedef Galois::Graph::FirstGraph<Node, int, false> Graph

---

Function Documentation

int main	(	int	argc,
		const char **	argv
	)

static void makeGraph

(

const char *

input

)

[static]

void printGraph

(

)

void runBodyParallel

(

)

---

Variable Documentation

const char* description = "Computes the Minimal Spanning Tree using Boruvka\n" [static]

Graph graph

const char* help = "<input file> " [static]

GaloisRuntime::PerCPU<unsigned int> MSTWeight

const char* name = "Boruvka MST" [static]

unsigned int nodeID = 0 [static]

std::vector<GNode> nodes

const char* url = "boruvkas_algorithm" [static]