def SmallWorld(n): # slow graph = SparseGraph(n) generator = SmallWorldGenerator(0.3, 50) graph = generator.generate(graph) l, _ = graph.adjacencyList() return convertAdjListToEdgeList(l)
def BarabasiAlbertEdgeList(n): graph = SparseGraph(n) generator = BarabasiAlbertGenerator(10, 10) graph = generator.generate(graph) l, _ = graph.adjacencyList() return convertAdjListToEdgeList(l)
def ConfigurationModel(edges_list): deg_dict = defaultdict(int) for u, v in edges_list: deg_dict[v] += 1 l = array(deg_dict.values()) n = len(l) graph = SparseGraph(n) generator = ConfigModelGenerator(l) graph = generator.generate(graph) l, _ = graph.adjacencyList() return convertAdjListToEdgeList(l)
def ConfigurationModel(edges_list): deg_dict = defaultdict(int) for u,v in edges_list: deg_dict[v] += 1 l = array(deg_dict.values()) n = len(l) graph = SparseGraph(n) generator = ConfigModelGenerator(l) graph = generator.generate(graph) l, _ = graph.adjacencyList() return convertAdjListToEdgeList(l)