Main Branches

Downloads  Installation  Overview  Data Libraries  Packages  Documentation  Contacts  FAQ  GAP 3 
This is a page on GAP 3, which is still available, but no longer supported. The present version is GAP 4  (See  Status of GAP 3).

GAP 3 Share Package "grape"

GRAPE: Graph Algorithms using PErmutation groups

Share package since release 3.2, about May 1993.
Corresponding GAP 4 package: GAP 4 package "grape".


Leonard Soicher.


Language: GAP 3 and C
Operating system: Unix for the nauty part
Current version: 2.31 (in the 3.4.4 distribution)


GRAPE (Version 2.31) is a system for computing with graphs, and is primarily designed for constructing and analysing graphs related to groups and finite geometries.

GRAPE is provided "as is", with no warranty whatsoever. Please read the copyright notice in the file COPYING.

The vast majority of GRAPE functions are written entirely in thes GAP 3 language, except for the automorphism group and isomorphism testing functions, which use Brendan McKay's package nauty (version 1.7) Nau90.


A GRAPE manual is given in chapter 63 of the GAP 3 manual.


[Nau90] B.D. McKay, nauty user's guide (version 1.5), Technical report TR-CS-90-02, Australian National University, Computer Science Department, ANU, 1990. nauty homepage:

[Soi91] L.H.Soicher, GRAPE: a system for computing with graphs and groups, in "Groups and Computation" (L. Finkelstein and W.M. Kantor, eds), DIMACS Series in Discrete Mathematics and Theoretical Computer Science 11, pp. 287-291.

Contact address

Except for the nauty 1.7 package included with GRAPE, the GRAPE system was designed and written by

Leonard Soicher
School of Mathematical Sciences
Queen Mary, University of London
London, E1 4NS