Algorithm Repository README File

The directory structure and source files in this algorithm repository are
listed below:

dict/
    avl.c           - AVL tree.
    avl.h
    avl_test.c      - AVL tree example program.
    bst.c           - Binary search tree.
    bst.h
    bst_test.c      - Binary search tree example program.
    dict_info.h     - Supplies a universal structure type for all dictionaries.
    dict_test.c     - Tests and compares the CPU time used by each dictionary.
    dst.c           - Digital search tree implementation.
    dst.h
    dst_test.c      - Digital search tree example program.
    hash_test.c     - Hash table example program.
    hashtbl.c       - Hash Table.
    hashtbl.h
    rand.c          - A 32 bit random number generator.
    rand.h
    rbtree.c        - Red-Black tree.
    rbtree.h
    rbtree_test.c   - Red-Black tree example program.
    rst.c           - Radix search tree.
    rst.h
    rst_test.c      - Radix Search tree example program.
    skip_list.c     - Skip-list.
    skip_list.h
    skip_list_test.c - Skip-list Example program.
    tree23.c        - 2-3 tree.
    tree23.h
    tree23_ext.c    - Extended 2-3 tree (supports O(1) delete-min)
    tree23_ext.h
    tree23_ext_test.c - Extended 2-3 tree example program.
    tree23_test.c   - 2-3 tree example program.    
graphalg/
    da.c            - Dijkstra's algorithm.
    da.h
    da_test.c       - Dijkstra's algorithm example program.
    da_simple.c     - Program for simple 1-D array Dijkstra's algorithm.
    dfs_bfs.c       - Depth first search and breadth first search.
    dfs_bfs.h
    dfs_bfs_test.c  - DFS/BFS test program.
    mst.c           - Minimum spanning tree algorithms.
    mst_test.c      - Test program for minimum spanning tree algorithms.
    sc.c            - Tarjan's "SC component" algorithm.
    sc.h
    sc_test.c       - Tarjan's algorithm test program.
graphs/
    dgraph.c        - Directed graphs.
    dgraph.h
heaps/
    bheap.c         - Binary heap source.
    bheap.h
    fheap.c         - Fibonacci heap source.
    fheap.h
    heap_info.c     - Common interface to all heaps.
    heap_info.h
    triheap.c       - Simple trinomial heap.
    triheap.h
    triheap_ext.c   - Extended trinomial heap
    triheap_ext.h
    ttheap.c        - 2-3 heap.
    ttheap.h
    ttheap2.c       - 2-3 heap (using node-pair representation).
    ttheap2.h
searching/
    search.c        - Array searching algorithms.
    search.h
    search_test.c
sorting/
    sort.c          - Various array sorting algorithms.
    sort.h
    sort_test.c     - Example program for array sorting algorithms.
timing/
    timing.c        - Provided functions used for timing the algorithms.
    timing.h          Allows the user to choose which clock function is used.

This directory structure is expected by some of the source files and makefiles.
For example, the source file da.c specifies the header file dgraph.h as:

    #include ../graphs/dgraph.h

Each directory has a makefile for compiling that directories source files.
An object file (.o) resulting from compilation is placed in the same directory
as the corresponding source (.c) source.  A makefile in one directory may
recursively call a makefile in another directory if the program is linked with
object files in that directory.

Refer to individual source files and their corresponding documentation for more
detailed information.