|
8 | 8 |
|
9 | 9 | from __future__ import annotations |
10 | 10 |
|
| 11 | +import random |
11 | 12 | import tempfile |
12 | 13 | from pathlib import Path |
13 | 14 |
|
@@ -366,12 +367,12 @@ def test_simulation_ecology_integration(self): |
366 | 367 | # Simulate genetic sequences for species |
367 | 368 | species_sequences = {} |
368 | 369 | for species_idx in range(min(5, n_species)): # Just first 5 species |
369 | | - base_sequence = generate_random_dna(50, rng=np.random.RandomState(species_idx + 100)) |
| 370 | + base_sequence = generate_random_dna(50, rng=random.Random(species_idx + 100)) |
370 | 371 |
|
371 | 372 | # Add mutations for population diversity |
372 | 373 | mutated_sequences = [] |
373 | 374 | for _ in range(3): # 3 individuals per species |
374 | | - mutated = mutate_sequence(base_sequence, n_mut=2, rng=np.random.RandomState(species_idx * 10 + _)) |
| 375 | + mutated = mutate_sequence(base_sequence, n_mut=2, rng=random.Random(species_idx * 10 + _)) |
375 | 376 | mutated_sequences.append(mutated) |
376 | 377 |
|
377 | 378 | species_sequences[f"Species_{species_idx}"] = mutated_sequences |
@@ -519,18 +520,20 @@ def test_network_scalability(self): |
519 | 520 | n_nodes = 10 # Very small for reliable execution |
520 | 521 | node_names = [f"Node_{i}" for i in range(n_nodes)] |
521 | 522 |
|
522 | | - network = create_network(node_names) |
| 523 | + # Create edges for a ring network |
| 524 | + edges = [(node_names[i], node_names[(i + 1) % n_nodes]) for i in range(n_nodes)] |
| 525 | + network = create_network(edges) |
523 | 526 |
|
524 | | - # Add a few edges to create a connected network |
525 | | - edges = [(0, 1), (1, 2), (2, 3), (3, 4), (4, 5), (5, 6), (6, 7), (7, 8), (8, 9), (0, 9)] |
526 | | - for i, j in edges: |
| 527 | + # Add a few more weighted edges |
| 528 | + extra_edges = [(0, 5), (2, 7), (3, 8)] |
| 529 | + for i, j in extra_edges: |
527 | 530 | weight = np.random.uniform(0.1, 1.0) |
528 | | - network.add_edge(node_names[i], node_names[j], weight) |
| 531 | + network.add_edge(node_names[i], node_names[j], weight=weight) |
529 | 532 |
|
530 | 533 | # Should handle small networks |
531 | 534 | metrics = network_metrics(network) |
532 | 535 | assert metrics["num_nodes"] == n_nodes |
533 | | - assert metrics["num_edges"] == len(edges) |
| 536 | + assert metrics["num_edges"] == len(edges) + len(extra_edges) |
534 | 537 |
|
535 | 538 | # Skip community detection for now as it's too slow |
536 | 539 | # communities = detect_communities(network, method="greedy", seed=42) |
|
0 commit comments