Project developed as semestral project in Data Structures and Algorithms at University of Pardubice.
Shortest Path - find the shortest path in graph with Dijkstra algorithm or Floyd Matrix.
Table - associative array, implementations with hash table, linked list, table in external memory.
Priority Queue - implemented with PairingHeap.
Binary Tree - basic tree data structure.
Binary Search Tree - ordered binary tree.
Range Tree - available 1D and 2D Range Tree.
Red Black Tree - self-balancing binary search tree used as index structure for block files.
Search Algorithms - binary and interpolation search.