(self, num_walks, walk_length, schema=None)
| 298 | return walk |
| 299 | |
| 300 | def simulate_walks(self, num_walks, walk_length, schema=None): |
| 301 | G = self.G |
| 302 | walks = [] |
| 303 | nodes = list(G.nodes()) |
| 304 | # print('Walk iteration:') |
| 305 | if schema is not None: |
| 306 | schema_list = schema.split(",") |
| 307 | for walk_iter in range(num_walks): |
| 308 | random.shuffle(nodes) |
| 309 | for node in nodes: |
| 310 | if schema is None: |
| 311 | walks.append(self.walk(walk_length=walk_length, start=node)) |
| 312 | else: |
| 313 | for schema_iter in schema_list: |
| 314 | if schema_iter.split("-")[0] == self.node_type[node]: |
| 315 | walks.append(self.walk(walk_length=walk_length, start=node, schema=schema_iter,)) |
| 316 | |
| 317 | return walks |
| 318 | |
| 319 | |
| 320 | def get_G_from_edges(edges): |
no test coverage detected