**CMU Artificial Intelligence Repository**

` `

## TUT: Source code from a Scheme-based algorithms class at
Tampere University of Technology.

lang/scheme/edu/tut/

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.

Copying: Copyright (c) 1988 Juha Heinanen
The code may be freely distributed.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Mailing List: none
Contact: Pertti Kellom\"aki
Tampere Univ. of Technology
Software Systems Lab
Finland
Keywords:
AVL Trees, Binary Trees, Depth-First Search,
Dijkstra's Algorithm, Expression Evaluation,
Finite State Machines, Floyd's Shortest Path Algorithm,
Graph Traversal, Hash Tables, Heap Sort,
Knuth-Morris-Pratt String Searching, Matrix Routines,
Merge Sort, Queues, Quicksort, Random Number Generators,
Scheme!Algorithms, Scheme!Code, Scheme!Documents,
Selection Sort, Shortest Paths, Skew Heaps, Stacks,
String Searching, Tampere Univ. of Technology,
Teaching Materials
References: ?

Last Web update on Mon Feb 13 10:37:31 1995

AI.Repository@cs.cmu.edu