GPLv3

vpar.gp

This is some functions for Pari/GP making calculations on labelled oriented trees and forests (graph theory trees) as "vpar" vector of parent vertex numbers. Various things treat as unlabelled and/or free too. Functions include

Vertices are numbered 1 to n. A tree is a vector "vpar" where vpar[v] is parent of v, or 0 if no parent. Such a representation is oriented in that there is a distinguished root (or roots for a forest) and labelled in that each vertex has a particular number. There are no other attributes.

        3
       ^ ^          tree, root=3
      /   \
     1     5        vpar=[3,1,0,1,3]
    ^ ^
   /   \
  2     4

The main use is to calculate or verify properties of specific trees of interest. Various functions like diameter are the same for any root or labelling so effectively act as on a "free" tree and the vertex numbers just define the structure. Most functions are linear in the number of vertices so can be used on large trees.

Connections to Pari/GP specifics include polynomials for roots (spectra), matrices for some linear algebra, Set()s for independent sets, permutations in relabelling and automorphisms, and then general compactness of GP for experimenting etc.

vpar.gp is free software (free as in freedom), published under the terms of the GNU General Public License (v3 or higher). Download version 21 here,

vpar.gp (746k, and sig), or compressed vpar.gp.gz (199k)
vpar-21.tar.gz (1226k, and sig)

Just vpar.gp is enough to run. Comments at the start give an introduction and overview, then each function has an addhelp(). The tar file includes some example scripts, self-tests, and work-in-progress extras (vpar-wip.gp). These extras mostly work but may change wildly. The sig files are Gnu PG ascii armoured signatures generated from my key.

The examples include bits of

Bugs

vpar_to_free() in version 19 and earlier had a bug where it did not give the intended free-primary form (per vpar_free_next() iteration). See note in vpar.gp for some details. The wrong form was still canonical (fine for unduplicating up to isomorphism etc), but was not the free-primary canonical form.


See also gentreeg in the Nauty tools which can generate free trees in vertex parent form, and other forms, and can be used from the command line or in C code.

See my Graph-Maker-Other for some other graph (and tree) creation, in Perl.

See my Nautyextra for some C code.


This page Copyright 2017, 2018, 2019, 2020, 2021, 2022 Kevin Ryde, except for the GPLv3 logo which is Copyright Free Software Foundation and used here in accordance with its terms.

(Back to the sitemap, or the Pari/GP section there).