win 7

Hamiltonian Circuit Checking

Submitted by Arup Kr Goswami on
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.

Test Whether Two Graphs are Isomorphic or Not

Submitted by Arup Kr Goswami on
Hello, this is a simple C source code, written in dev-C++ platform (OS- Windows 7). This code actually check whether two given graphs are Isomorphic or not. Basically here both graphs are represented by their Adjacency matrix. At first this check whether two graph has equal number of vertices or not, then if they have the same number of edges, then again it is checked that whether they have equal