eletricalengineer101
Newbie level 2
Does anyone know how to do this shuffle exchange problem? Or can point me in the right direction?
In a single stage shuffle exchange graph, there are N={2}^{n} nodes which are labeled from 0 to N-1. Each node i has up to 4 neighbors. The neighbors of node i are node 2i mod N and node (2i+1) mod N (corresponding to a left shift) as well as node (int) i/2 and (N/2 + (int) i/2). These correspond to right shifts. (Here (int) x denotes the integer part of the number X). Suppose that N=256.
A) Find two distinct paths between node 71 and node 240. Find the length of the shortest hop path between node 71 and node 240. (You need not draw the graph!)
B) What is the maximum number of hops between any two nodes for the case N=256?
Thanks!
In a single stage shuffle exchange graph, there are N={2}^{n} nodes which are labeled from 0 to N-1. Each node i has up to 4 neighbors. The neighbors of node i are node 2i mod N and node (2i+1) mod N (corresponding to a left shift) as well as node (int) i/2 and (N/2 + (int) i/2). These correspond to right shifts. (Here (int) x denotes the integer part of the number X). Suppose that N=256.
A) Find two distinct paths between node 71 and node 240. Find the length of the shortest hop path between node 71 and node 240. (You need not draw the graph!)
B) What is the maximum number of hops between any two nodes for the case N=256?
Thanks!