README.dox

/**
 * @file README.dox
 * @mainpage Project Presentation
 * @par Introduction
 * Some basic dynamic data structures implemented as pure, generic ADT:s, coded in ANSI C.
 * - Singly-linked list
 * - Doubly-linked list
 * - Stack
 * - Queue
 * - Chained hash table
 * - Heap
 * - Priority queue
 * - Binary search tree
 * - AVL tree
 * .
 * Original and major parts of the code written by 
 * <a href="http://www.kyleloudon.com/" target="_blank">Kyle Loudon</a>, in his book "Mastering Algorithms with C", published at <a href="http://shop.oreilly.com/product/9781565924536.do" target="_blank">O'Reilly Company</a>.\n
 * Minor adjustments and extensions added by <a href="https://github.com/dale48" target="_blank">Dan Levin</a>.
 * @author   <a href="http://www.kyleloudon.com/" target="_blank">Kyle Loudon</a> and <a href="https://github.com/dale48" target="_blank">Dan Levin</a>
 * @date     Fri Mar 22 13:13:19 2013
 * @version  0.40 (<a href="md__change_log.html">To ChangeLog</a>)
 * @par ToDo
 *  Continue making more pure, generic ADT:s - such as:
 * - A <b>Graph</b>, <b>Set</b> and <b>Circular list</b> ADT - in due time...\n
 * .
 **/