This repo is for generating and visualizing graphs of the DDM labeling
There are 3 parts to this repo, the Java portion, which is responsible for generating the graphs, the Python portion, which is responsible for generating the visualization of the graphs found in the Java code, and the Circulant Graph portion which is dedicated to finding DDM Labelings within Circulant graphs
If the only thing you are interested in seeing are the visualizations, click here: https://github.com/MuellMark/DDMGraphLabelingGenerator/blob/Mueller/GraphVisualizations/GraphVisualization.md. This will take you to a separate markdown file explaining all of the graphs that have already been generated and their visualizations
This code was built on VSCode using java 1.8.0_341 and python 3.9.7. The only things that needed to be installed were networkx and matplotlib, which were pip-installed. Below are some helpful links if you're having trouble getting it setup:
Networkx documentation: https://networkx.org/documentation/stable/install.html
Matplotlib documentation: https://matplotlib.org/stable/users/installing/index.html
In case you have issues pip-installing in VSCode: https://stackoverflow.com/questions/42463866/how-to-use-pip-with-visual-studio-code
Once you have everything installed, you can look at the other two markdown files below for more information on how to generate and visualize graphs.
The java code is responsible for the generation of all of the text versions of the graphs. All of the code can be found in the Java Code folder with explanations found in the .md file, or here: https://github.com/MuellMark/DDMGraphLabelingGenerator/blob/Mueller/Java%20Code/JavaCode.md
The python code is responsible for taking in a text output from the java code and visualizing it. This is done with networkx and matplotlib. All of the code is in the Python Code folder and explanations can be found in the .md file, or here: https://github.com/MuellMark/DDMGraphLabelingGenerator/blob/Mueller/Python%20Code/PythonCode.md
Circulant Graphs is the newest section in this repo. Circulant Graphs are uniform graphs where every edge has a degree of 4 and each is mapped (https://en.wikipedia.org/wiki/Circulant_graph). This section of the code uses Maven for a package to run, which VSCode and Eclipse both support. For troubleshooting, you can visit https://code.visualstudio.com/docs/java/java-build for VSCode or https://www.vogella.com/tutorials/EclipseMaven/article.html for Eclipse. More info on this section can be found here: https://github.com/MuellMark/DDMGraphLabelingGenerator/blob/Mueller/Circulant%20Graph%20Code/CirculantGraph.md This section is still under development, so more features and optimizations are coming soon!
All past code that didn't end up getting used can be found in the Legacy Code Folder, with explanations found in the .md file, or here: https://github.com/MuellMark/DDMGraphLabelingGenerator/blob/Mueller/Legacy%20Code/LegacyCode.md
There are more updates coming soon, so stay tuned!