Random simple symmetric graph

This simple C source code is written in dev-C++ platform, (OS- Win 7). Here, in a given random simple symmetric graph, whether there a Hamiltonian circuit exists or not, is being checked. This is based on the formula: If 2e >= [ (n^2) - 3n + 6 ], then there hamiltonian circuit exits, else not. e & n are the number of edges & vertices respectively here.

This simple C source code is written in dev-C++ platform. Here a subgraph will be generated of a simple symmetric random graph. At first Create a Simple symmetric random graph, (for n vertices) & now enter number of vertices for subgraph. automatically subgraph will be generated. thnks.

This code generates a Simple symmetric random graph initially & then it also generates the complement graph of that graph. This is written in Dev-C++ platform. Let a simple symmetric random graph is denoted by G, then we say the complement graph will be denoted by G'. Consider G has three vertices (1, 2, 3) & egdes (a, b). a exists between 1 & 2, b exists between 2 & 3. No edge exists between 1 &