ROTATING 3D GRAPHS

The task is to plot in 3D a weighted directed full graph comprising of 3 or 4 nodes. On the input you get a) graph’s nodes coordinates, b) weights for each edge c) background cloud of points coordinates. All input is in .csv format. First, you plot a coordinates system fitting values passed as parameters. Second, you plot in pale gray background cloud of points. Third, you plot nodes (vertices) of the graph as bigger circles. Fourth, you plot edges (graph is directed full so there will be 9 edges for n=3 graph and 16 edges for n=4 graph). Fifth, you plot weights for each edge. If weight is 0 you do not plot it. The difficult part comes next. The plot has to be interactive: user can zoom in (easy) and rotate the plot. When the plot gets rotated at any time you have to make sure the arcs are intersecting in the clearest possible way. If n=3 you should be able to make a 3D graph without intersections. For n=4 there will be intersections, but you should make some restrictions, for example on the number of intersections per one edge.