Graph Search and a Word Game.
Examine a famous graph algorithm called breadth-first search, which shows the shortest path connecting nodes in a tree. Use this technique to write a program creating an entertaining game, in which a word is transformed one letter at a time, with each new iteration required to be a valid word.
Saved in:
Corporate Author: | |
---|---|
Format: | Electronic Video |
Language: | English |
Published: |
The Great Courses,
2016
|
Subjects: | |
Online Access: |
Streaming video (Wentworth users only) |
Local Note: | Kanopy |