For a degree4 Borel Cayley graph in the GCR representation with and ,  we have classes, where (mod ). Assume the generators to be , , and , where  .  Given the source and the destination .  While ()  Step 1: Identify new destination,  ,  where signifies the operation within the bracket is modulo .  Step 2: From row of a precalculated routing table, determine which link to take.  Step 3: Identify new source, and  , , if link was chosen  , , if link was chosen  , , if link was chosen  , , if link was chosen  Step 4: and 
