**graph_theory_test**,
a FORTRAN90 code which
calls graph_theory(), which
carries out operations on abstract graphs, such as a breadth-first-search,
the computation of a minimum spanning tree,
an Euler or Hamilton circuit, blocks, chromatic polynomial, or transitive
closure. Objects include undirected and directed graphs, weighted
graphs, and trees.

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

graph_theory, a Fortran90 code which carries out operations on abstract graphs, such as a breadth-first-search, the computation of a minimum spanning tree, an Euler or Hamilton circuit, blocks, chromatic polynomial, or transitive closure. Objects include undirected and directed graphs, weighted graphs, and trees.

- graph_theory_test.f90, calls all the tests.
- graph_theory_test.sh, runs all the tests;
- graph_theory_test.txt, the output file.

- 57_city_distances.txt, a city distance table.

**KNIGHTSTOUR** is a GRF file created to illustrate a Knight's tour
of the chess board.

- knightstour.grf, a knight's tour graph in GRF format.
- knightstour.png, a PNG image of the knight's tour graph.

**FISH** is a set of data defining a 3D model of fish. Various routines
manipulate this data.

- fish_faces.iv, an Inventor file that contains the "faces" of the fish, that is, the polygonal surfaces.
- fish_faces.png, a PNG image of a "snapshot" of the fish face model.
- fish_lines.vla, a VLA file that records the edges of the polygonal surfaces of the fish model.
- fish_nodes.png, a PNG file that displays a "snapshot" of the nodes of the fish model.