Structures de Données et leurs algorithmes avec FORTRAN 90 / 95
DATA   STRUCTURES   and   THEIR   ALGORITHMS
in   FORTRAN   90 / 95

MASSON, 1996, 356 pages (ISBN 2-225-85373-8)

  Editor's Reference.

TABLE   OF   CONTENTS:

  1. A BIT OF METHODOLOGY (pages 13-34)
       (with: Advanced Aspects of Fortran 90 coding, etc.)

  2. SETS

  3. STACKS and QUEUES (pages 53-78)

  4. LISTS (pages 79-120)
       (with Applications: A Polynome type; Bucket Sort)

  5. SPARSE MATRICES (pages 121-142)

  6. GRAPHS (pages 143-186)
       with their main algorithms, among which searching the Maximum Flow by DINIC & KARZANOV algorithm,...

  7. TREES (pages 187-224)
       with general or n-ary trees

  8. BINARY SEARCH TREES

  9. TABLES OR DICTIONNARIES I: A.V.L. TREES (pages 249-288)
       with Priority Queues, and static sparse Matrix Tables

  10. HASHING, OR DIRECT ACCESS NOSTALGIA (pages 289-312)
       internal hashing, and on direct access files.

  11. B - TREES
       (on direct access files)

4 Appendices, among which a MODULE for Exception Handling.


All the Modules in the book are generic, that is reusable
WITHOUT ANY internal modification with data of any type, for instance:
Sparse Matrices of Reals, of Complexes, of Intervals...

Here is an example of module from the book.

The same author already published in April 1996 the first volume
in french language to include FORTRAN 95:

Manuel Complet du Langage FORTRAN 90 et FORTRAN 95
 Calcul intensif et Génie Logiciel

Mailbox