摘要
本文提出一种用逻辑对称轴的关系,解决N维布尔序集唯一相邻的逻辑路径问题。同时还给出一种限维内任一逻辑相邻子集的确定方法。其结果简单直观,适合于计算机实现。这种思想,对于二分树快速搜寻和二分树排序决策等,也具有一定意义。
By means of logic symmetric relation, single neighbouring logic path for N dimension Boolean ordered set is solved. A new method of determining any logic neighbouring subset in limited dimensions is given. Its results are intuitional and realizable for computer.
关键词
布尔序集
逻辑对称轴
相邻路径
Boolean ordered set
Single neighbouring path
Logic symmetry
