Graph routines by Hang Tong Lau

LAUPACK is a FORTRAN90 library which carries out a variety of operations on mathematical graphs.

Routines are included to:


LAUPACK is available in a FORTRAN90 version.

Related Data and Programs

CODEPACK, a FORTRAN90 library which computes "codes" that can determine if two graphs are isomorphic.

DIJKSTRA, a FORTRAN90 program which runs a simple example of Dijkstra's minimum distance algorithm for graphs.

FLOYD, a FORTRAN90 library which implements Floyd's algorithm for finding the shortest distance between pairs of nodes on a directed graph.

GRAFPACK, a FORTRAN90 library which carries out operations on abstract graphs.

GRAPH_REPRESENTATION, a data directory which contains examples of ways of representing abstract mathematical graphs

GRF, a data directory which contains a description and examples of the GRF file format for storing graphs.

SUBSET, a FORTRAN90 library which enumerates combinations, partitions, subsets, index sets, and other combinatorial objects.


Hang Tong Lau


  1. Hang Tong Lau,
    Algorithms on Graphs,
    Tab Books, 1989,
    LC: QA166 L38.

Source Code:

Examples and Tests:

List of Routines:

You can go up one level to the FORTRAN90 source codes.

Last revised on 27 November 2006.