GitHub - adityamuralidaran/Connected-Components-Using-MapReduce: Implemented an algorithm using large-star and small-star operations on a large undirected graph to find the connected component label for every vertex using Python / Apache Spark. It is assumed that un-directed graph on which we are operating is too large to be represented in the memory of a single compute node.

adityamuralidaran / Connected-Components-Using-MapReduce Public

Notifications You must be signed in to change notification settings
Fork 0
Star 2

Implemented an algorithm using large-star and small-star operations on a large undirected graph to find the connected component label for every vertex using Python / Apache Spark. It is assumed that un-directed graph on which we are operating is too large to be represented in the memory of a single compute node.

MIT license

2 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
LICENSE		LICENSE
LargeStarSmallStar_Algorithm.PNG		LargeStarSmallStar_Algorithm.PNG
README.txt		README.txt
a2.py		a2.py
input.txt		input.txt

Repository files navigation

Implemented an algorithm using large-star and small-star operations on a large undirected graph to find the connected component label for every vertex using Python/Spark.
It is assumed that un-directed graph on which we are operating is too large to be represented in the memory of a single compute node.

Run using the following command:
	PATH=$PATH:/opt/spark-2.2.0-bin-hadoop2.7/bin
	spark-submit a2.py input.txt output


Sample input is given in 'input.txt'