GRF_TO_EPS
Convert a GRF file to EPS format


GRF_TO_EPS is a FORTRAN90 program which converts a GRF "graph" file (a format used by the Combinatorica program) to a EPS image file.

In other words, it can draw a picture of an abstract graph.

Usage:

grf_to_eps file.grf file.eps
reads the GRF file file.grf and makes an Encapsulated PostScript image file in file.eps.

Licensing:

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

Languages:

GRF_TO_EPS is available in a FORTRAN90 version.

Related Data and Programs:

EPS, a data format which is used when an image is to be printed on a PostScript printer, or displayed with programs such as GhostView or GhostScript.

EPS_TO_JPG, a BASH script which converts a collection of EPS files to JPEG format.

EPS_TO_PNG, a BASH script which converts a collection of EPS files to PNG format.

GRAFFITI, a dataset directory which contains 195 abstract graphs, with adjacency and embedding information, stored in the GRF format.

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

GRF, a data directory which contains a description of the GRF format and some examples.

GRF_DISPLAY, a MATLAB program which reads a GRF file defining a mathematical graph and displays it in the MATLAB graphics window.

GRF_DISPLAY_OPENGL, a C++ program which reads a GRF file defining a mathematical graph and displays it in an OpenGL graphics window.

GRF_IO, a FORTRAN90 library which reads and writes GRF files.

GRF_TO_XYL, a FORTRAN90 program which converts information describing the adjacency and embedding of an abstract graph from GRF to XYL format.

PS_WRITE, a FORTRAN90 library which creates PostScript images.

Reference:

  1. Stephen Skiena,
    Implementing Discrete Mathematics: Combinatorics and Graph Theory in Mathematica,
    Addison Wesley, 1990.
  2. http://www.combinatorica.com/
    the COMBINATORICA web page.
  3. Peter Eades, Ian Fogg, David Kelly,
    SPREMB: A System for Developing Graph Algorithms,
    Congressus Numerantium,
    Volume 66, December 1988.

Source Code:

Examples and Tests:

HEAWOOD is the Heawood graph:

KNIGHTSTOUR is the knight's tour graph:

PETERSEN is the Petersen graph:

TUTTE is the Tutte graph:

List of Routines:

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


Last revised on 15 November 2006.