dgtst(1)
π dgtst(1) β bestie edition π
okay so this is the dgtst page from the PT-Scotch user's manual, and honestly? it's giving "quietly powerful". let's get into it π«Ά
β¨ NAME β¨
dgtst β test the consistency of source graphs in parallel π
β¨ SYNOPSIS β¨
dgtst [options] [gfile] [lfile]
β¨ DESCRIPTION β¨
so here's the vibe: the dgtst program checks, in a parallel way, the consistency of a Scotch source graph β and if everything passes the vibe check, it outputs some statistics about edge weights, vertex weights, and vertex degrees. π
It produces the very same results as the gtst(1) program of the Scotch sequential distribution, but unlike that one, it can handle distributed graphs. no cap. π
Source graph file gfile is either a centralized graph file, or a set of files representing fragments of a distributed graph. The resulting statistics get stored in file lfile. And when file names aren't specified? data is read from standard input and written to standard output. You can also explicitly represent standard streams with a dash '-'. iconic behavior honestly.
When the proper libraries have been included at compile time, dgtst can directly handle compressed graphs, both as input and output π. A stream is treated as compressed whenever its name is postfixed with a compressed file extension, like in 'brol.grf.bz2' or '-.gz'. The compression formats that can be supported are:
- the bzip2 format (
'.bz2') - the gzip format (
'.gz') - the lzma format (
'.lzma')
dgtst bases on implementations of the MPI interface to spread work across the processing elements π¦. So it is therefore not likely to be run directly, but instead through some launcher command such as mpirun. like, it needs its support system, and same.
β¨ OPTIONS β¨
-hβ Display some help. π₯Ί-rpnumβ Set root process for centralized files (default is0). β-Vβ Display program version and copyright. π
β¨ EXAMPLE β¨
Run dgtst on 5 processing elements to test the consistency of graph brol.grf
$ mpirun -np 5 dgtst brol.grf
Run dgord on 5 processing elements to test the consistency of a distributed graph stored on graph fragment files brol5-0.dgr to brol5-4.dgr, and save the resulting ordering to file brol.ord (see dgscat(1) for an explanation of the '%p' and '%r' sequences in names of distributed graph fragments). π
$ mpirun -np 5 dgtst brol%p-%r.dgr brol.ord
not me noticing the example says dgord and then talks about saving an orderingβ¦ π bestie, that's literally what the page says, so I'm passing it straight through to you, fr fr. no edits, no guesses.
β¨ SEE ALSO β¨
PT-Scotch user's manual.
β¨ AUTHOR β¨
Francois Pellegrini <francois.pellegrini@labri.fr> π
and that's the whole page, bestie!! π this one came from the PT-Scotch user's manual, dated 23 November 2019, and it's page dgtst(1) β go be a main character with your parallel graph consistency checks. periodt. π
β¨
π¦ where this page comes from
- debian bookworm: ptscotch 7.0.3-2 Β· CeCILL-C
- debian trixie: ptscotch 7.0.7-1 Β· CeCILL-C
- ubuntu jammy: ptscotch 6.1.3-1 Β· CeCILL-C
- ubuntu noble: ptscotch 7.0.4-1ubuntu2 Β· CeCILL-C
- ubuntu questing: ptscotch 7.0.5-1ubuntu2
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash on : a language model's rewrite of the original, under its terms