GRF_TO_XYL
Convert a GRF file to XYL format


GRF_TO_XYL is a FORTRAN90 program which converts information about an abstract graph from GRF to XYL format.

The GRF format is used by the Combinatorica program. It records, for each node of the graph, the (X,Y) coordinates of each node in a drawing of the graph, and the nodes which are adjacent to that node.

In the XYL format, an XY file stores the (X,Y) coordinates of points, and an XYL file stores lists of node indices to be connected by lines.

Usage:

grf_to_xyl file.grf
where extracts the data, and stores the point data in file.xy, and the line data in file.xyl.

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_XYL is available in a FORTRAN90 version.

Related Data and Programs:

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_EPS, a FORTRAN90 program which converts a GRF file to EPS format;

XY_IO, a FORTRAN90 library which reads and writes XY, XYF and XYL files.

XYL, a data directory which contains examples of XYL files, a simple 2D graphics point and line format;

XYL_DISPLAY, a MATLAB program which reads XYL information defining points and lines in 2D, and displays an image using MATLAB.

XYL_DISPLAY_OPENGL, a C++ program which reads XYL information defining points and lines in 2D, and displays an image using OpenGL.

Reference:

  1. Stephen Skiena,
    Implementing Discrete Mathematics: Combinatorics and Graph Theory in Mathematica,
    Addison Wesley, 1990.
  2. Peter Eades, Ian Fogg, David Kelly,
    SPREMB: A System for Developing Graph Algorithms,
    Congressus Numerantium,
    Volume 66, December 1988.

Source Code:

Examples and Tests:

COXETER is the Coxeter graph:

K5 is the complete graph on 5 nodes:

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 12 January 2009.