Suppose you want to generate a graph with V vertices and E edges, such that each graph (i.e. each configuration of edges) is equally likely to be generated. For sparse graphs, you can just pick two vertices, and connect them if they’re not connected already. If they are connected, pick another two vertices. (Repeat
Generating Sparse And Dense Random Graphs
Generating Sparse And Dense Random Graphs
Generating Sparse And Dense Random Graphs
Suppose you want to generate a graph with V vertices and E edges, such that each graph (i.e. each configuration of edges) is equally likely to be generated. For sparse graphs, you can just pick two vertices, and connect them if they’re not connected already. If they are connected, pick another two vertices. (Repeat