中文摘要：

基于超立方体节点编码的特点,得到求任意两节点间的一条最短路径算法.算法包括八步骤,在最坏的情况下需要执行n＋2n^2次运算,其时间计算复杂度为O（n^2）,属于多项式算法.

英文摘要：

Based on the characteristic of the node codes in the n-dimensional hypercube,the shortest path algorithm between any two nodes was got.This algorithm involves eight steps.n ＋ 2n^2 times calculation should be executed in the worst case,and the algorithm complexity is O（n^2）.It belongs to a polynomial algorithm.