Abstract: RCP（n） which has been proposed recently，consists of ring，Petersen graph and crossing cube.It has shorter diameter，regularity，good extensibility and lest construction costs，so it is a kind of interconnection network having good topological characteristics.This paper，by the codes’ characteristics of RCP（n），gives the polynomial shortest path algorithm of between discretionary two nodes in RCP（n） adopting disintegrating codes step by step and finding path in turn.This algorithm provides theory support for studying communication capabilities such as route algorithm，optimization grouping，so it has theory significance and application value.