GRaph Algorithms using PErmutation groups for GAP
DescriptionGAP is a system for computational discrete algebra with particular emphasis on computational group theory, but which has already proved useful also in other areas. This package implements computing with graphs and groups for GAP. GRAPE is primarily designed for constructing and analysing graphs related to groups, finite geometries, and designs; special emphasis is placed on the determination of regularity properties and subgraph structure.
198 other people were interested in this package here. The newest known version of this software is 4r7+ds-3 (Information last updated 29 minutes ago.)
Upload new screenshots
Thanks for uploading more screenshots. Please note:
- Your screenshot should contain a typical scene when working with it.
- Take only a screenshot of the respective application and not of your whole desktop (unless the screenshot is meant for a window manager).
- Your screenshots must be in PNG format.
- You can upload multiple images at once.
- Your screenshot need to be approved by the moderators first. You will already see your screenshot but it will not be visible to others instantly. If moderators reject your upload you will get notified next time you visit this site (requires cookies).
- Images larger than 800x600 pixels will automatically be reduced. So don't try to capture too much detail in a screenshot. It may become unreadable. Shrink the applications window if possible.
- Screenshots are made public and can freely be used by anyone.
- Useful programs for making screenshots are shutter, ksnapshot (KDE), gimp, xwd or scrot. See the Debian wiki for more information on how to make screenshots under Debian.
- Please set your language to english so that everybody understands it. If you don't use english by default please start your application from a shell using after setting "export LANG=C".