**laupack_test**,
a FORTRAN90 code which
calls laupack(), which
computes properties of mathematical graphs, including Euler circuits,
Hamiltonian circuits, cliques, strongly connected components, minimal
spanning tree, chromatic number, shortest paths, maximal flow,
and planarity.

The computer code and data files made available on this web page are distributed under the MIT license

laupack, a FORTRAN90 code which computes properties of mathematical graphs, including Euler circuits, Hamiltonian circuits, cliques, strongly connected components, minimal spanning tree, chromatic number, shortest paths, maximal flow, and planarity.

- laupack_test.f90, a sample problem.
- laupack_test.sh, runs all the tests.
- laupack_test.txt, the output file.