circulant-topologies-dataset

Circulant topologies with different generators count (2-10)
This is a dataset consisting of signatures of optimal circulant topologies for various parameters.
Circulants are regular topologies based on the Cayley graphs of a cyclic group. This type of topologies can be described as C(n; s_1,…,s_k), where n – number of nodes, k – number of generators, and k<n, k = 2..10.
CSV files format:
nodes count; graph signature; Diameter; average distance; generating time; connections count

circulantGraphs_10.03.2022

Rename redme.md to readme.md

GCG (Greed Circulant Generator) - First release

The first release of the application for the synthesis of circulant topologies (PCG) which is based on the developed algorithm GCG (Greed Circulant Generator).

Features:

• Finding optimal circulant graphs by the criterion of minimum diameter / average distance;
• Saving the progress made upon completion of the application.
• Output detailed information.

The PCG.Library dynamic library can also be used by other software solutions.