This project offers a C++ method to study graph substructure induced by geometrical frustration. The main consideration for determining emergent sturcture is pseudo-graph entropy and Monte Carlo sampling of complete graph colorings.
wahorvat / frustrated-graphs Goto Github PK
View Code? Open in Web Editor NEWMonte Carlo graph formation and clique distributions in random complete graphs
License: Apache License 2.0