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.
We have 10+ years of experience in software development. We have few questions:
1. Will the node id be always be in sequence or can it be in random ?
2. Is it enough if we give you the java file and jar file ?
3. Will you test it under Cloudera virtual machine ?
Thanks and Regards,
RKSolutions
Hi there, I'm a professional Map-Reduce application developer, I can develop this for you next few hours and will be 100% plagiarism free. Ping me for discussions.
We are team of excellent developers and writers. We have 2 year experience related to your project field. We can do your project and solve your all problems according to your requirements. We have read your description for projects and we understand what you want so we are confident that we can do it easily in mention time. We assure you that you will be completely satisfy with our work. And after delivering your project if you feel some issue in understanding the projects then we will teach you free until you understand.
If you have any question then feel free to ask. We are here for you.
Thank you