The Shortest Path Algorithm Between Two Arbitrary Nodes Based on Cycle Permutation in the Star Graph

For the routing plays an important role in the performance of the network，the shortest path algorithm between two arbitrary nodes in the star graph is proposed．The distance form ula between two points is proved by using the nature of the cycle perm utation of the Group Th eory，and the general algebraic expression for the number of all the shortest paths between two nodes is provided．