Simple Path Example

Want to go from beginning of sentence to the end using only valid words.

For now, let's say that valid words are 3 or more letters:

• both, the, hear, heart, ear, earth, art, than, hand, hands, and, sat, saturn, turn, turns, spin, pin

What kind of graph do we get? What is true of the order of the nodes?

How find a path through?

Use a table to decrease our overhead.