WordLadder.java


Below is the syntax highlighted version of WordLadder.java from §4.5 Case Study: Small World.


/******************************************************************************
 *  Compilation:  javac WordLadder.java
 *  Execution:    java WordLadder word1 word2 < wordlist.txt
 *  Dependencies: Graph.java In.java PathFinder.java
 *
 *  java WordLadder break flirt < words5.txt
 *  flirt
 *  flint
 *  fling
 *  cling
 *  clink
 *  click
 *  clock
 *  cloak
 *  croak
 *  creak
 *  break
 *
 *  % java WordLadder allow brown < words5.txt
 *  NOT CONNECTED
 *  
 ******************************************************************************/


public class WordLadder {

    // return true if two strings differ in exactly one letter
    public static boolean isNeighbor(String a, String b) {
        int differ = 0;
        for (int i = 0; i < a.length(); i++) {
            if (a.charAt(i) != b.charAt(i)) differ++;
        }
        return (differ == 1);
    }

    public static void main(String[] args) {
        String from = args[0];
        String to   = args[1];
        if (from.length() != to.length()) 
            throw new RuntimeException("Words have different lengths");

       /*******************************************************************
        *  Read a list of strings, all of the same length.
        *  At most 10000 words supported here.
        *******************************************************************/
        String[] words = new String[10000];
        int n = 0;
        while (!StdIn.isEmpty()) {
            words[n] = StdIn.readString();
            if (words[n].length() != from.length())
                throw new RuntimeException("Words have different lengths");
            n++;
        }
        System.err.println("Finished reading word list");

       /*******************************************************************
        *  Insert connections between neighboring words into graph.
        *  This construction process can be improved from L n^2 to
        *  L n log n by sorting, where L = length of words.
        *******************************************************************/
        Graph G = new Graph();
        for (int i = 0; i < n; i++)
            for (int j = i+1; j < n; j++)
                if (isNeighbor(words[i], words[j]))
                    G.addEdge(words[i], words[j]);
        System.err.println("Finished building graph");

       /*******************************************************************
        *  Run breadth first search
        *******************************************************************/
        PathFinder finder = new PathFinder(G, from);
        if (finder.hasPathTo(to)) StdOut.println(finder.pathTo(to));
        else                      StdOut.println("NOT CONNECTED");
    }
}


Copyright © 2000–2017, Robert Sedgewick and Kevin Wayne.
Last updated: Fri Oct 20 14:12:12 EDT 2017.