/backtracking_graceful_labelling

a program that generates all graceful labellings of a graph

Primary LanguagePython


Backtracking Graceful Labelling

A python program that generates all graceful labelings of a simple undirected graph.


usage

This program was built for the python interpreter. To run the program, type 'python labeler.py' in the terminal. Make sure your terminal session is in the directory that contains the file 'labeler.py'.


edges.txt

The file edges.txt contains the adjacency list of the graph to be verified. An edge in the list is formatted '[a,b]' where a and b are integers corresponding to vertices in the graph. The vertices must be 0-indexed.