分支限界法算法作业：图形变换问题解题报告和源代码。问题描述：给定2个4×4方格阵列组成的图形A和B,每个方格颜色为黑色或白色。方格阵列中有公共边的方格称为相邻方格。图形变换问题的每一步可以交换相邻方格的颜色。试设计一个队列式分支限界算法，计算最少需要多少步变换，才能将图形A变换成图形B。-Branch and bound algorithm operation: graphics transform the issue of problem-solving reports and source code. Descr iption of the problem: given two 4 × 4 grid array of graphics components A and B, each box is black or white color. Grid arrays in the public square known as the adjacent side of the box. Transform the issue of graphics can be exchanged every step of the color of the adjacent box. Try to design a queue-type branch and bound algorithm to calculate the minimum number of steps need to transform, can be converted into graphics A graphics B.