Please report any error you may happen to find.
Fortran 2008for versions released since 2020 ( qgraf-3.5 +), and Fortran 77for earlier versions.
Executables/binaries are not distributed, the program has to be compiled and linked.
Employing GNU Fortran for that task should be straightforward, eg there should be no need to specify a Fortran standard (see eg file
There are executable/binary versions of GFortran for several operating systems, as described in the GFortranBinaries webpage.
The features added in the last three versions include (eg):
selecting 1–vertex irreducible diagrams (3.4);
selecting diagrams with non-factorizable cycle spaces (3.4);
generating multiple output files in the same run (3.5);
inputing simple command-line arguments (3.5);
an extended language for describing input models (3.6);
a more general
qgraf-3.4should be available and supported for some time yet (minimal fixes as need be); qgraf-3.6should be declared stable by December 01, with the features available in qgraf-3.6.5, unless some unresolved serious issue exists at that time (leaving the Fortran and C interfaces to qgraf-3.7, in 2023, seems to be preferable).
Automatic Feynman graph generation
J. Comput. Phys. 105 (1993) 279–289
▻ show outline ▻ hide
This paper presents a concise description of an orderly algorithm for generating Feynman diagrams, on which
Qgrafis based. In addition, it presents a diverse set of numbers — either the numbers of graphs in certain sets or the sums of the respective symmetry factors — which may be employed to cross-check the correctness of Feynman diagram generators.
The diagram generation with explicitly mixed propagators (kinetic mixing) can be reduced to the usual one:
Feynman graph generation and propagator mixing, I
Comput. Phys. Commun. 269 (2021) 108103
▻ show outline ▻ hide
Given a QFT model A with explicitly mixed propagators, this paper shows how to construct a modified model B without that kind of mixing, such that the Feynman diagrams in A may be easily derived from the diagrams in B. Moreover, it explains in detail why the method works; for example, it shows that if a diagram in B gives rise to some diagram in A then those two diagrams have identical symmetry factors.