Minor refactoring; changed 'DisposeLinkedList' function name to more appropriate 'DisposeLinkedListWithElements';
added 'TraverseAndDisposeLinkedList' function.
Minor refactoring; added memory problems handling; changed 'DisposeList' to 'DisposeListWithElements' (more appropriate);
added 'TraverseAndDisposeList' function.
minor fix.
Accomodated change in 'DisposeLinkedListWithElements' function name.
Removed unnecessary file.
Removed unnecessary .h and .o files.
Removed unnecessary file.
Changed return type of functions 'ExtractMinElement', 'LookUpMinElement' and 'PopHeapElementAtIndex' to 'tHeapElement*';
added 'update function' argument to 'ExtractMinElement' and 'PopHeapElementAtIndex' functions - this function will be
called each time elements change their indices in heap array - thus allowing to remember the new index of an element
in heap (needed for Prim's algorithm using heaps) - not very elegant, but you may just pass NULL inside for usual heap
uses.
Accomodated changes in SimpleHeap interface functions; added tests for new functionality - 'PopHeapElementAtIndex'.
Fixes; removed printf's; added keys book-keeping; added one dispose function - 'DisposeHashMapWithIDs';removed 'main'
function.
Implemented 'SimpleGraph' data structure (using list of vertices and list of edges representation); Interface:
-InitGraph
-AddVertexWithData
-AddEdge
-MimimumSpanningTree
-DisposeGraphMemoryOnly
-DisposeGraphWithVerticesData
Implemented testing program for SimpleGraph data structure; provided it with sample file to test MinimumSpanningTree
function.
Added command-line programs for testing data structures.