The bandwidth problem is numbering the vertices of a given graph G such that the maximum diference between the numbers of adjacent vertices is minimal. This is known to be NP-complete and only few special cases of this problem are known to be efficient. This program uses backtracking to solve this problem.
Each text file has information about graph.
The first number is number of vertices and second number is number of edges.
Last part shows the numbers of vertices that are adjacent.
12
11
1 2
1 3
2 4
2 5
3 6
3 7
4 8
4 9
5 10
5 11
6 12
Use Visual Studio to run this program