Clustering.cpp File Reference

Single source shortest paths -*- C++ -*-. More...

#include "Galois/Statistic.h"
#include "Galois/Graphs/Graph.h"
#include "Galois/Galois.h"
#include "Galois/util/Accumulator.h"
#include "Galois/Graphs/Serialize.h"
#include "Galois/Graphs/FileGraph.h"
#include "Lonestar/Banner.h"
#include "Lonestar/CommandLine.h"
#include <vector>
#include <map>
#include <string>
#include <sstream>
#include <limits>
#include <iostream>
#include <fstream>
#include <set>
#include "LeafNode.h"
#include "Point3.h"
#include <stdlib.h>
#include <assert.h>
#include "LeafNode.h"
#include "NodeWrapper.h"
#include <math.h>
#include <algorithm>
#include "ClusterNode.h"
#include <sys/time.h>

Classes
struct	FindMatching
Defines
#define	DEBUG_CONSOLE   0
Functions
void	loopBody (NodeWrapper *cluster, KdTree *kdTree, std::vector< NodeWrapper * > *wl, std::vector< ClusterNode * > *clusterArr, std::vector< double > *floatArr)
void	getRandomPoints (vector< LeafNode * > &lights, int numPoints)
int	findMatch (KdTree *tree, NodeWrapper *nodeA, GaloisRuntime::galois_insert_bag< NodeWrapper * > *&newNodes, GaloisRuntime::galois_insert_bag< NodeWrapper * > &allocs, vector< double > *coordinatesArray, vector< ClusterNode * > &clusterArray)
void	clusterGalois (vector< LeafNode * > &lights)
void	clusterSerial (vector< LeafNode * > &lights)
int	main (int argc, const char **argv)
Variables
static const char *	name = "Unordered Agglomerative Clustering"
static const char *	description = "Unordered Implementation of the well-known data-mining algorithm\n"
static const char *	url = "agglomerative_clustering"
static const char *	help = "[num points]"
Galois::GAccumulator< size_t >	addedNodes

---

Detailed Description

Single source shortest paths -*- 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.

Description

Agglomerative Clustering.

Author:

Rashid Kaleem <rashid.kaleem@gmail.com>

---

Define Documentation

#define DEBUG_CONSOLE   0

---

Function Documentation

void clusterGalois

(

vector< LeafNode * > &

lights

)

!!!!!!!!!!!!!!!!!!Cleanup

void clusterSerial

(

vector< LeafNode * > &

lights

)

!!!!!!!!!!!!!!!!!!Cleanup

int findMatch	(	KdTree *	tree,
		NodeWrapper *	nodeA,
		GaloisRuntime::galois_insert_bag< NodeWrapper * > *&	newNodes,
		GaloisRuntime::galois_insert_bag< NodeWrapper * > &	allocs,
		vector< double > *	coordinatesArray,
		vector< ClusterNode * > &	clusterArray
	)

void getRandomPoints	(	vector< LeafNode * > &	lights,
		int	numPoints
	)

void loopBody	(	NodeWrapper *	cluster,
		KdTree *	kdTree,
		std::vector< NodeWrapper * > *	wl,
		std::vector< ClusterNode * > *	clusterArr,
		std::vector< double > *	floatArr
	)

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

---

Variable Documentation

Galois::GAccumulator<size_t> addedNodes

const char* description = "Unordered Implementation of the well-known data-mining algorithm\n" [static]

const char* help = "[num points]" [static]

const char* name = "Unordered Agglomerative Clustering" [static]

const char* url = "agglomerative_clustering" [static]