CARAT Introduction / Programs / Graph

Previous Program | Introduction | Next Program

## Program Graph

### Usage

    Graph 'file1' [-h] [-o] [-i] [-f] ['file2']

file1: REDUCED pointgroup G with CORRECT order
file2: (Optional) Presentation of G

### Description

Calculates the "graph of inclusions" for a geometric class given by G.
For further information on the output see example 13.

### Options

    -h    : Give a short help.
    -o    : Do not calculate the corresponding supergroup numbers.
            The programm is faster then.
    -i    : Print the Z-classes to 'file1.i' and the affine classes
            to 'file1.i.j',
    -f    : Recalculate the formspace even if it is given.
    -d    : Only for debugging!

### Remarks

If the formspace and the normalizer are given, they have to be correct.

See also for Extensions/Vector_systems, KSubgroups, KSupergroups, Order, Presentation, QtoZ.

### Examples

1. Calculate the "graph of inclusions" for a given geometric class.

Previous Program | Introduction | Next Program