摘要
本文提出广探生长树法是表上作业法中搜索闭回路的一种快速算法。采用本方法,最多只要对m×n矩阵中的元素进行两次搜索,就可找到所求的闭回路,因而最大限度地减少了搜索闭回路的时间。
We put forward a broad-searching-growing-tree-method that is a quicker algorithm for searching closed loop in operation-at-table-method. We can find the required closed loop for a mxn metrix elements only with lesser than twice so it will extremely reduce searching time for finding closed loop.
关键词
搜索
闭回路
快速算法
运输
transportation, operation-at-table-method, broad-searching- growing-tree-method, closed loop, searching
