Algorithm · Atlassian · Medium
Requirements The input consists of directed pairs, with each pair describing one segment of a cart route. Every edge is oriented from its source location to its destination location. Determine every starting location. For each starting point, produce the set of all terminal locations that can be reached from it. Let N denote the total number of input pairs. Examples O can arrive at T, Y, and Z; R can finish at U, Y, or Z; and W reaches only X.
Checking your access…