c

Operations Research: Least Cost Rule Solver

Submitted by Gabrael_Instinct on
This application, written in C++ is a console application for solving transportation problem in operations research. The app accepts unlimited rows and columns and add domin where necessary and determines if a problem is a non-degenerated problem by appropriate allocation and optimisation. The complete source code is uploaded to assist students and researchers in their various endeavours. You are

Quiz Management System in C++

Submitted by Imran Cusitian on
Hello World...!!! Though I am not an expert programmer but today i want to share my little knowledge of C/C++ programming by sharing this simple Quiz Management System with you people. I hope this may help some students in their mini assignments/projects. It is a Quiz Management System in C/C++ which contains Quizes in form of MCQs for various subjects. You people are free to modify this program

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

Sub-Graph generation of a Random graph

Submitted by Arup Kr Goswami on
This is a simple source code written in C, Dev-C++ software, platform- Windows 7. It generates a Random Simple symmetric graph at first & then generates an arbitrary subgraph from that particular graph. The sub-graph may contain only one vertex of the graph as well as may contain a vertex set & edge set of that graph. Thanks.