Web Links for Chapter 9
Page 440, Trees
The graph theory site by Christopher Mawata,
Page 444, Huffman Codes
A Huffman code demonstration is at http://www.ee.uwa.edu.au/~roberto/teach/itc314/java/Huffman/.
Page 449, Equivalent Definitions of Trees
See my own site treedef.pdf.
Page 454, Spanning Trees
See http://www.utc.edu/~cpmawata/petersen/lesson20.htm.
Page 455, Breadth-First Search
An animation of breadth-first search is available at http://www.cs.duke.edu/csed/jawaa/BFSanim.html.
Page 456, Depth-First Search
An animation of depth-first search is available at http://www.cs.duke.edu/csed/jawaa/DFSanim.html.
Page 457, n-Queens Problem
An animation of the n-queens problem is at http://www.math.utah.edu/~alfeld/queens/queens.html. My own source code is nqueens.c.
Page 461, Minimal Spanning Trees
See http://www.utc.edu/~cpmawata/petersen/lesson23.htm and http://www.cs.sunysb.edu/~algorith/files/minimum-spanning-tree.shtml.
Page 462, Prim’s Algorithm
An animation of Prim’s Algorithm is at http://www-b2.is.tokushima-u.ac.jp/~ikeda/suuri/index.html. My own source code for Prim’s Algorithm is prim.c.
Page 466, Kruskal’s Algorithm
Animations of Kruskal’s Algorithm are at http://www-b2.is.tokushima-u.ac.jp/~ikeda/suuri/index.html and http://students.ceid.upatras.gr/~papagel/project/kruskal.htm.
Page 478, Reverse Polish Notation (RPN)
See http://www.hpmuseum.org/rpn.htm and http://www.hpmuseum.org/rpnvers.htm.
Page 486, Isomorphisms of Trees
My source code for determining whether two binary trees are isomorphic is bin_tree.c.
Page 496, Game Trees
See http://en.wikipedia.org/wiki/Game_tree.
Page 501, Chinook
The Chinook checker program site is http://web.cs.ualberta.ca/~chinook.