Question
Implement a function bool chainable(vector v), which takes a set of strings as parameters and returns true if they
bool chainable(vector v)
true
This can be solved by a reduction to the Eulerian path problem by considering a digraph G with N(G) = Σ and E(G) = a->e for words aWe.
a->e
aWe