Write a Scheme program to reverse a web link graph so that for each web site considered, we know those web sites that contain links to it, Use a list to represent the given web link graph where each of its element contains all the links of a same host. For example, [a, b, c] means that from a, we have a link to b and a link to c. Represent the reversed web link graph in a similar way. For example, [a, b, c] means that {b, c} is the set of web sites that contain links to a. If the input is [[a, b, c], [b, c, e], [c, b, a]], for example, your Scheme program should produce this list: [[a, c], [b, a, c], [c, a, b], [e, b]]. LANGUAGE IS SCHEME OR RACKET, DON'T PROVIDE ME THE CODE IN PYTHON
Write a Scheme
LANGUAGE IS SCHEME OR RACKET, DON'T PROVIDE ME THE CODE IN PYTHON
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 2 images