Random connected graph generation
-
Updated
Nov 8, 2017 - Java
Random connected graph generation
The Preferential Deletion Model (PDModel) is an implementation of the original discrete-time random graph generation process described by Narsingh Deo and Aurel Cami. 2020.
The Preferential Deletion Model with Changing in Existing Connections (PDCModel) is an extension of the discrete-time random graph generation process described by Narsingh Deo and Aurel Cami in 2005. This new model accounts for changes in existing edges for every unit of time, representing the behavior of social circles more accurately. 2020.
Implementazione java di pathfinding con A* e generazione grafi con Erdős-Rényi
Add a description, image, and links to the graph-generation topic page so that developers can more easily learn about it.
To associate your repository with the graph-generation topic, visit your repo's landing page and select "manage topics."