My implementations of commonly used data structures.
All algorithms use the dynamically allocated version of the respective structure, i.e.:
list.c
andqueue.c
use linked listsgraph.c
uses de edge list implementationheap.c
uses nodes and pointers instead of an array