- Codes based on doubly linked lists, trees and combination of
them:
- Code which generates, traverses and modifies a doubly linked list of pointer to trees where the leaves point to doubly linked lists
- Code for the sparse matrix-vector multiplication in which the sparse matrix is stored by a doubly linked list of pointers to doubly linked lists, and the vectors are doubly linked lists
- Code for the sparse matrix-vector multiplication in which each sparse matrix is stored by a doubly linked list of pointers to doubly linked lists
- Code for the sparse LU factorization in which the sparse matrix is stored by a doubly linked list of pointers to doubly linked lists
- Code for the Barnes-Hut n-body simulation in which the main data structure is an octree where the leaves point to items of a single linked list

- Codes based on
**arrays of pointers**, doubly linked lists, trees and combination of them:- Code for the sparse matrix-vector multiplication in which the sparse matrix is stored by an array of pointers to doubly linked lists, and the vectors are doubly linked lists
- Code for the sparse matrix-vector multiplication in which each sparse matrix is stored by an array of pointers to doubly linked lists
- Code for the sparse LU factorization in which the sparse matrix is stored by an array of pointers to doubly linked lists
- Code for the Barnes-Hut n-body simulation in which the main data structure is an octree where the leaves point to items of a single linked list. Arrays of pointers are used to store the pointer to the eight children of each node in the tree.

Rafael Asenjo Plaza Last modified: Mon Feb 25 17:34:43 CET 2002