algorithm - BFS - WordChain/Wordladder -


i need problem. want find longest shortest path between word , given endword. words have of length 4. have graph each node represents word , every word different in 1 position connected.

i have list words. have proper function finds longest shortest path, starts every word in word list , bfs every word in word list.

how can i, given endword, find word has longest shortest path given endword ?

by longest shortest path mean shortest path words endword , longest path amongst them.

how can 1 bfs ?

thank you

when doing breadth-first search, can tag each node in graph distance (the length of shortest path) source node. since word ladders reversible, try running breadth-first search end word, tagging each word how many hops away ending word. this, can keep track of word you've found that's far away possible start word. once you're done, can output word word distance far possible start word.

hope helps!


Comments

Popular posts from this blog

c# - Send Image in Json : 400 Bad request -

jquery - Fancybox - apply a function to several elements -

An easy way to program an Android keyboard layout app -