random simple undirected weighted graphs

This dataset contains 61 randomly generated simple weighted graphs. Each file corresponds to a graph's flow matrix (adjencancy matrix with weights). The generation of the graphs follows a specific strategy. The graphs orders are in the range [20, 3000] and their densities (the number of edges) go from 0.1 to 1.0 with a step equal to 0.1 which leads to different sizes (the number of edges). The weights are also randomly generated in the range [1, 15]. The main idea behind the generation process is to get graphs with a specific shape, where the vertice's set is divided into a certain number of clusters for example if we have twenty vertices, then the graph will mainly generated with 4 clusters each of them contains 5 vertices. the edges within the same cluster have heavier weights compared to those inter-clusters (i.e. edges connecting clusters to each other). Each time we increase the density of the graph by adding new edges, we first add them within the clusters and once the clusters are fully connected, we add inter-cluster edges with lighter weights generally equal to 1. For example, the first graph is formed by 20 vertices with a density = 0.1 means that we have 19 edges. and so on. Please feel free to use these graphs in your works and don't forget to reference them.