( Graph theory ) make c++ program

I have 2 projects ( graph theory ) Program: Write a program in C++ to generate a connected (single component) random undirected graphs. The edges may follow any probability distribution (uniform or otherwise). The main function should take an integer argument that specifies the number vertices in the graph. The generated graph representation should be saved as a text file. Report: Write your name, ID, section, department, and submission date along with the title “Project I: Graph Theory (CS403)” on the front page. Then • Write an introduction including the specification of your compiler and the computer where you ran the program. Describe how your program works (how do we call it, what are the command line parameters, what is the output, how is it saved.) • Specify which graph representation was used in your program. • Explain and justify the method that was used to generate random graphs and explain your randomization strategy. • Explain how you made sure that the generated graph is a single connected component. • Describe and explain any design decisions and assumptions that you needed to make to write the program (you will need to make many decisions on your own.) • Generate 50 different random graphs for each problem sizes using different ‘seed’ values and compute the density of each graph. Then complete the following table. Note: density = (number of edges)/(n choose 2) Where n is the number of vertices in the graph ********************************************* the deadlines for first project will be in 1 APR 2015 *********************************************