Question: Map the following scenario to a graph theory problem. Explain what the vertices and the edges of the graph are and why the two problems
Map the following scenario to a graph theory problem. Explain what the vertices and the edges of the graph are and why the two problems are equivalent. Clearly mention any assumptions that you make.
A catenym is a pair of words separated by a period such that the last letter of the first word is the same as the first letter of the second. For example, the following are catenyms: dog.gopher, gopher.rat, rat.tiger, etc. A compound catenym is a sequence of three or more words separated by periods such that each adjacent pair of words forms a catenym. For example, dog.gopher.rat.tiger is a compound catenym. Now, you are given a dictionary of a words in English as input. You want to determine if there is a compound catenym that uses each word in the dictionary exactly once
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
