In this project you will be solving the problem of counting the neighboring nodes of a node in a network. If two nodes have a link/an edge, they are considered neighbors. You can think of the network as Friendship network (nodes are friends and links represent friendship relations), Co-Authorship network (nodes are authors and links represent common work) …etc.
You will be given a network file. The file has the network you will work with. When you download the file from the link given below, you need to open it. You can extract the compressed file using WinRAR for instance. To open the network file, notepad or notepad++ will not be a good choice because the file is huge for a simple text editor.
However, you can open it using a free editor such as PilotLite. The file needs a very simple cleaning. You need to remove the first 4 lines in order to keep the network only. For more information please check the description file.
Hello Sir/Mam
NovaSofts Inc. is the leading IT Company of Islamabad Pakistan. We have 9+ years of experience and strong knowledge about programming languages
Java
C++
C
C#
Android
So you don't worry about third party client. We are very much experienced and assure you that we’ll provide quality work. The project bid is negotiable and P.M for sample work. Thanks
so, the main idea of your project is to read the network file using Java and then output for every node how many neighbours it has, .... this is a very fast program to make.
If you are interested just leave me a message on chat
I have written many simple MapReduce program like that. When I finish, the code will include Unit Test with MRUnit and I can guide you how to run it with Hortonwork Sanbox.