For each c-net, you will find a file named cnet_k.txt (where k is an integer between 1 and 37). The data in the file has the following form:

The ith term in this sequence lists the vertices that vertex i is connected to.

Method: In Maple, open bnetscreation.mws, execute the procedure bnetscreation, and run bnetscreation on each of the above c-net files. For the file cnet_k.txt, a series of files called cnet_k_m.txt will be created. k is the c-net number and m is the number of a p-net (where m is an integer between 1 and 14). Each p-net is represented as a matrix.

2. Find the solutions, if they exist.

For each p-net matrix, solve each of the corresponding 2¹³ linear systems (if the system has a solution). Use one of the following two methods:

Method 1: Open newsearch.mws, execute the procedure newsearch, and run newsearch on each p-net file created in step 1.

Method 2: Create a new directory, and copy check.m, grey.m, onebnet.m, search.m, ming, and any number of p-net files into this directory. Then, in a terminal window (not in Maple), type:

The shell script will automatically run newsearch on each file whose name is of the form cnet_k_m.txt. It will create a solution file named cnet_k_m.txt_solution for each such p-net file.

Method 2 is highly recommended since it is much more efficient.

3. Compute heights and widths of rectangular elements

For each solution file, compute the heights and widths of the rectangular elements corresponding to each output. Also, filter out solutions that have zero elements or duplicate elements. However, you will still have to filter out some solutions by hand.

Method: In Maple, open rectangle.mws, execute the procedure rectangle, and run rectangle on each file whose name has the form cnet_k_m.txt_solution. A file called cnet_k_m.txt_rectangles will be created, if any valid solutions remain.