Concise JAVA solution based on BFS

The basic idea is to build a graph based on characters of word, and then set 'a' to 'z' as neighbors of each character in the word. Replace one character with 'a' to 'z' one time, using level by level BFS to find the shortest transformation sequence path. As the following: