Home Page ] [ Eiffel Archive ] [ Eiffel Classes and Clusters ]

Arc de Triomphe clipart (2486 bytes)Kedsal


Written by Jeffrey H. Kingston

kedsal_1_0.zip (150,033 bytes)


Kingston's Eiffel Data Structures and Algorithms Library v1.0

KEDSAL is a library of data structures and algorithms written in Eiffel and available free under the GNU Public License. The library contains multiple implementations of many common abstract data types, plus sorting algorithms and graph algorithms (see the end of this blurb for the complete list).

Some features:

The complete list of ADTs and their implementations in this version is:

BINTREE_ADT
    BINTREE_LINKED
BINTREE_EXTENDED_ADT
    BINTREE_EXTENDED_LINKED
    BINTREE_EXTENDED_COUNTED
DIGRAPH_ADT
    DIGRAPH_LISTS
DISJSETS_ADT
    DISJSETS_LINKED
FOREST_ADT
    FOREST_LINKED
LIST_ADT
    LIST_DLL
LIST_INDEXED_ADT
    LIST_INDEXED_SPLAY
PRIQUEUE_ADT
    PRIQUEUE_SLL
    PRIQUEUE_BST
    PRIQUEUE_ARRAY
    PRIQUEUE_HEAP
PRIQUEUE_EXTENDED_ADT
    PRIQUEUE_EXTENDED_SLL
    PRIQUEUE_EXTENDED_HEAP
    PRIQUEUE_EXTENDED_FIBHEAP
    PRIQUEUE_EXTENDED_BST
    PRIQUEUE_EXTENDED_ARRAY
QUEUE_ADT
    QUEUE_SLL
    QUEUE_ARRAY
SIMPLESET_ADT
    SIMPLESET_SLL
    SIMPLESET_ARRAY
STACK_ADT
    STACK_SLL
    STACK_ARRAY
SORT_ADT
    SORT_SELECTION_RECURSIVE
    SORT_SELECTION_ARRAY
    SORT_SELECTION_ABSTRACT
    SORT_RADIXSORT_QUEUE
    SORT_QUICKSORT_QUEUE
    SORT_QUICKSORT_ARRAY
    SORT_MERGESORT_QUEUE
    SORT_INSERTION_BINARY
    SORT_INSERTION_ARRAY
    SORT_INSERTION_ABSTRACT
    SORT_HEAPSORT
    SORT_BUBBLE
SYMTAB_ADT
    SYMTAB_HASHCHAINS
SYMTAB_ORDERED_ADT
    SYMTAB_ORDERED_BST

KEDSAL was designed and implemented by Jeffrey H. Kingston (jeff@cs.su.edu.au) of the Basser Department of Computer Science at the University of Sydney.


Home Page ] [ Eiffel Archive ] [ Eiffel Classes and Clusters ]