getmin(method getmin(method traces getsuccessor(method trees graph class - vertices graphdw workshop applet - adding shortest-path array deleting graphn workshop applet weighted dfs minimum spanning trees graphs - see also weighted graphs graphw workshop applet - guess- -number game adjacency choosing connected critical path analysis directed connectivity and - hamiltonian cycles hash functions edgesadding computation graph class - folding lines hashing strings maze analogy non-random keys - minimum spanning trees graphn applet java code - mst java random keys hash tables choosing hash javalinear probing - pins hashchain java representing in apps hashdouble workshop applet adjacency list hashfunc(method adjacency matrix hashfunc (method edges hashfunc (method vertices hashfunc (method searching hashing - breadth-first search - choosing depth-first search - collisions - sparse dictionary - topological sorting - efficiency cycles/trees open addressing - graphd applet - open addressing versus separate chaining java code -