h1liasss.com

C++ OpenGL project where the program each iteration produce by 1 vertex till the N from which first one has a weight 2*m, and each next has m weight and m ways to connect to each vertex of existing graph. Which the vertex who has to connect to next one can do it only by matching the probability space. More info about the project and source code you can find in this github repo