Hamiltonian Circuit Checking
Submitted by Arup Kr Goswami on Monday, April 4, 2016 - 16:36.
Language
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.
Note: Due to the size or complexity of this submission, the author has submitted it as a .zip file to shorten your download time. After downloading it, you will need a program like Winzip to decompress it.
Virus note: All files are scanned once-a-day by SourceCodester.com for viruses, but new viruses come out every day, so no prevention program can catch 100% of them.
FOR YOUR OWN SAFETY, PLEASE:
1. Re-scan downloaded files using your personal virus checker before using it.
2. NEVER, EVER run compiled files (.exe's, .ocx's, .dll's etc.)--only run source code.
Add new comment
- 43 views