## C Program to Implement Branch and Bound Method

This is a C Program to solve TSP. The Traveling Salesman Problem states that, given a list of cities and the distances between each pair of cities, calculate the shortest distance route that visits each city exactly once and route returns to original city. It is an NP-hard problem. Here is source code of the … Read more

## C Program to Demonstrate 4-Color Problem

This is a C Program to demonstrate and implement 4 color problem. The four-color theorem states that any map in a plane can be colored using four-colors in such a way that regions sharing a common boundary (other than a single point) do not share the same color. Here is source code of the C … Read more

## C Program to Find Hamiltonian Cycle in an UnWeighted Graph

This is a C Program to find hamilton cycle. Hamiltonian Path in an undirected graph is a path that visits each vertex exactly once. A Hamiltonian cycle (or Hamiltonian circuit) is a Hamiltonian Path such that there is an edge (in graph) from the last vertex to the first vertex of the Hamiltonian Path. Determine … Read more