Branson, LukeSutton, Andrew M2023-07-142023-07-142023-07-14https://hdl.handle.net/11299/255140The archive contains 1679 compressed files, each containing 100000 text files, except the last compressed file which contains 79144 text files. This is a total of 167879144 text files, corresponding to the 167879144 unlabeled trees from order 3 to order 25 (cf. entry A000055 in The On-Line Encyclopedia of Integer Sequences). Each text file is named tree-<n>-<id>.viz where <n> is the order of the tree (number of vertices) and <id> is a unique identifier. Each text file represents a unique tree with labeled vertices and edges in the DOT graph description language. The vertex/edge labeling corresponds to an antimagic labeling found by an evolutionary algorithm as presented in the paper "Finding Antimagic Labelings of Trees by Evolutionary Search" by L. Branson and A. M. Sutton. https://doi.org/10.1145/3594805.3607133This dataset contains antimagic labelings of all trees of order 3 to 25 as described in the paper "Finding Antimagic Labelings of Trees by Evolutionary Search"CC0 1.0 Universalhttp://creativecommons.org/publicdomain/zero/1.0/graph labelingantimagic labelingDatasethttps://doi.org/10.13020/pnrb-cm94