Description: Branch and bound method of a wiring problem, requirement: 1, enter the circuit board wiring region n* m and the start position and end position 2, output routing program 3, you can use c or vc achieve two, the analysis and experimental principle : n* m in the box in the array block area there (wiring must be bypassed in the region), the starting position to the target location to find the shortest path. Starting from the target location back to the starting position, and gradually construct the optimal solution. To mark each box marked distance from the current less than 1 in its adjacent cells move up until you reach the starting grid.
To Search:
- [code12122] - Wiring problems (branch and bound algori
- [WireRouter] - With queue-type branch boundaries method
File list (Check if you may need any files):
1(2).txt
Download