I need Write some softwares with Java

Problem 1: You are given a file (in the eclipse project under data/[login to view URL]) that contains the adjacency list representation of a simple undirected graph. There are 200 vertices labeled 1 to 200. The first column in the file represents the vertex label, and the particular row (other entries except the first column) gives all the vertices that the first vertex is adjacent to. So for example, the 6th row looks like: "6 155 56 52 120 ......". This just means that the vertex with label 6 is adjacent to (i.e., shares an edge with) the vertices with labels 155,56,52,120,......,etc Your task is to code up and run the randomized contraction algorithm for the min cut problem and use it on the above graph to compute the min cut. (HINT: Note that you'll have to figure out an implementation of edge contractions. Initially, you might want to do this naively, creating a new graph from the old every time there's an edge contraction. But you should also think about more efficient implementations.) Instructions: 1- Download the starting project from [login to view URL] The file is named [login to view URL] 2- Go to File-> Import->General->Existing project into workspace. About the graph library: [login to view URL] Problem 2: You are given a file (in the eclipse project under data/[login to view URL]) that contains the adjacency list representation of a simple undirected graph. There are 200 vertices labeled 1 to 200. The first column in the file represents the vertex label, and the particular row (other entries except the first column) gives all the vertices that the first vertex is adjacent to. So for example, the 6th row looks like: "6 155 56 52 120 ......". This just means that the vertex with label 6 is adjacent to (i.e., shares an edge with) the vertices with labels 155,56,52,120,......,etc Your task is to code up and run the randomized contraction algorithm for the min cut problem and use it on the above graph to compute the min cut. (HINT: Note that you'll have to figure out an implementation of edge contractions. Initially, you might want to do this naively, creating a new graph from the old every time there's an edge contraction. But you should also think about more efficient implementations.) (WARNING: As per the lectures, please make sure to run the algorithm many times, and remember the smallest cut that you ever find.) Instructions: 1- Download the starting project [login to view URL] The file is named [login to view URL] 2- Go to File-> Import->General->Existing project into workspace. 3- The project misses the library “[login to view URL]”. It can be downloaded here: [login to view URL] _NsC3E6AMguRjqpI3HXa?dl=0 Copy the file into the /lib folder of your project. The example code should be working now. 4- You will also find in the same link some documentation about Neo4j. You should now have the project in your workspace. Navigate the project’s files to have an idea about the current code. Then add your solution code. Note:The main difference between both problems is the library that will be used to store your graph in-memory. In the first project, you have a light-weight nice library (graphstream) that supports dynamic graph visualization, this is useful to illustrate how algorithms work for students for example. In the second project, a heavy-weight graph database is used (NEO4J). The advantage of the database solution is that it is more interesting for those who want to pursue their research in the area of graphs. It is also much more used in the software industry ([login to view URL]). Of course when using a graph database every group of modifications must be carried out inside a transaction, the given code shows many examples.