Use BFS to search through graph which represents Word Chain problem in Java

I need to use Breadth-first-search for a Word chain problem. I have a text file with 5 letter words, the goal is to use these words and create a graph that shows connection between words based on the first words 4 last letters if they can be found in the next word. For example climb → blimp → limps → pismo → moist. So climb goes to blimp because they both have l, i, m and b, but they blimp can't go back to climb because the four last letters...

Read More »

By: StackOverFlow - 7 days ago

Related Posts