Package: lang/scheme/edu/tut/ Name: TUT Summary: Source code from a Scheme-based algorithms class at Tampere University of Technology. Version: Description: This directory contains source code for various data structures and algorithms that are covered at Tampere University of Technology in the course 81120, "Data Structures and Algorithms". Includes code for AVL trees, binary trees, various queue implementations, DFS search, Dijkstra's algorithm, expression evaluation, Floyd's shortest path algorithm, finite-state machines, graph traversal, hash tables, heap sort, Knuth-Morris-Pratt algorithm for string searching, matrices, merge sort, quicksort, random numbers, selection sort, skew heaps, stacks, and string searching. Requires: Ports: Origin: Copying: Copyright (c) 1988 Juha Heinanen The code may be freely distributed. Updated: CD-ROM: Prime Time Freeware for AI, Issue 1-1 Bug Reports: Mailing List: none Author(s): Contact: Pertti Kellom\"aki <[email protected]> Tampere Univ. of Technology Software Systems Lab Finland Keywords: Scheme!Algorithms, Scheme!Documents, Teaching Materials, Tampere Univ. of Technology, Scheme!Code, AVL Trees, Binary Trees, Queues, Depth-First Search, Dijkstra's Algorithm, Expression Evaluation, Floyd's Shortest Path Algorithm, Shortest Paths, Finite State Machines, Graph Traversal, Hash Tables, Heap Sort, Knuth-Morris-Pratt String Searching, Matrix Routines, Merge Sort, Quicksort, Random Number Generators, Selection Sort, Skew Heaps, Stacks, String Searching Contains: See Also: References: ???