Function main

code/chapter08/word_ladder.rs:215–234

()

}

fn main() {
    let words = vec![
        "FOOL", "COOL", "POOL", "FOUL", "FOIL",
        "FAIL", "FALL", "POLL", "PALL", "POLE",
        "PALE", "SALE", "PAGE", "SAGE",
    ];
    let len = words.len();
    let mut g = build_word_graph(words);

    // 首节点加入队列表明正被探索，所以颜色变为灰色
    g.vertices.get_mut("FOOL").unwrap().color = Color::Gray;

    // 取出首尾点
    let start = g.vertices.get("FOOL").unwrap().clone();
    let end = g.vertices.get("SAGE").unwrap().clone();

    // 计算最小转换次数，也就是距离
    let distance = word_ladder(&mut g, start, end, len);
    println!("the shortest distance: {distance}");
}