Write an algorithm that generates the routing for a given graph given in the following way :
- An adjacency list, where the i-th node has a link towards all nodes in adj[i]
- A target node, that is the index of the node where the packet should be headed
In particular, the algorithm should return an array such that packet at node i should be sent to node array[i], where array is the result.
Write an algorithm that generates the routing for a given graph given in the following way :
In particular, the algorithm should return an array such that packet at node i should be sent to node array[i], where array is the result.