The program "pathspacking_c" checks if all vertex-disjoint sums of paths with admissible sequences of orders (see "Vertex-distinguishing edge-colorings of sums of paths" for details) can be packed into a given graph G (M_n actually - see the same paper) with all endpoints mapped to different vertices (and provides us with the images of the packings). If it is not so, the program stops (until you push any button) and gives a counterexample. 

To work properly, the program needs an input file "G.txt", in which a graph is defined (the structure of this file is quite simple and is roughly described in the source code of the program). All the necessary (in view of the article "Vertex-distinguishing edge-colorings of sums of paths") input files "G.txt" are provided in a catalogue "Graphs."
(Warning: The input files are prepared in a special manner. If one tries to prepare input files by themselves, the program may become ineffective if the number of vertices exceeds 7.)

The final product of the program "pathspacking_c" is the resulting file "Greal.txt", which includes all the necessary information.

In case of any additional questions or doubts, do not hesitate to contact us on przybylo@wms.mat.agh.edu.pl.

P.S. For the source code of the program see "pathspa_c.cpp."