Artificial Intelligence
Links
Graph Search
Code
Data
TO DO
-
Given a word find all of its neighbors and print them out.
-
Build a data structure for the neighbor lists of all words.
-
Find three words with the most neighbors and print them.
-
Plot degree (x) and frequency (y). Describe the relation.
-
-
puzzles
-
BFS - queue
-
DFS - stack
-
DFS with Iterative Deepening
-
Bi-directional
-
-
Heuristic - letters in common with target
-
Astar - priority queue - open + closed
Railroad
Back to TJ CompSci
6 Sept 2016