Data Structures

1. Notes

Notes version 0.01a

2. Demo implementations of a few elementary data structures

2.1. Integer Sets

Object oriented implementation in Fortran Module. Can be vastly improved.

Integer Sets Module

2.2. Stack

Procedual implementation in Fortran Module.

Integer (Pseudopointers) Stack

Object oriented implementation in Fortran Module (Complete).

Stack Data Type

Object oriented implementation in C++ (not Complete).

Stack.cpp Stack.h

Dynamic list implementation in Fortran Module (Demo)

Integer Linked List

2.3. Queue

Procedual implementation of linear queue in Fortran Module.

Integer (Pseudopointers) Queue

Procedual implementation of circular queue in Fortran Module.

Integer (Pseudopointers) Circular Queue

Object oriented implementation in Fortran Module (Complete).

Queue Data Type

Object oriented implementation in C++ (not Complete).

Queue.cpp Queue.h

2.4. Disjoint Discrete Sets

Procedual implementation in Fortran Module

Integer (Pseudopointers) Disjoint Sets

2.5. Binary Heap

Procedual implementation of Integer Min Heap in Fortran Module (and Heapsort)

Integer (Pseudopointers) Min Heap

Object oriented implementation in Fortran Module (Complete, both Min and Max Heap plus Heapsort)

Heap Object

Object oriented implementation in Fortran Module with Type Bound Procedures (Complete, both Min and Max Heap plus Heapsort)

Heap Class


Athanasios Migdalas
Last modified: Tue Jan 11 15:14:40 EET 2011