This repository was archived by the owner on Dec 10, 2025. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathevolution.py
More file actions
182 lines (135 loc) · 5.07 KB
/
Copy pathevolution.py
File metadata and controls
182 lines (135 loc) · 5.07 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
import logging
import os
import shutil
import signal
from random import random
from typing import Optional
from src.drawing.draw import DrawEmbedding
from src.embedding.embedding import Embedding
from src.graph.test_graph import TestGraph
from src.results.degree_percentage import DegreePercentageData
from src.solver.embedding_solver import EmbeddingSolver, EvolutionParams
from src.util.logging import init_logger
init_logger()
logger = logging.getLogger('evolution')
stop = False
################################# Params #######################################
params = EvolutionParams(
population_size=12,
max_mutation_trials=30,
mutation_extend_to_free_neighbors_probability=0.3 # should be <=0.5
)
max_total = 1
max_generations = 1000
remove_redundancy_probability = 0.01
# Chimera graph
m = 2 # grid size
n = 2 # grid size
t = 4 # shore size
################################ Setup ########################################
H = TestGraph.crossed_house()
solver = EmbeddingSolver(H, m, n, t)
dp = DegreePercentageData(len(H.get_nodes()))
############################### Evolution ######################################
def main_loop():
for i in range(max_total):
logger.info('')
logger.info('#############')
logger.info('🎈 NEW MAIN 🎈')
logger.info('#############')
logger.info('')
logger.info(f'Calling main: {i}')
d = DrawEmbedding(m, n, t)
res = main(d)
save_final(d)
if res:
break
dp.plot_blocking()
def signal_handler(sig, frame):
# https://stackoverflow.com/questions/1112343/how-do-i-capture-sigint-in-python
global stop
stop = True
def main(d: DrawEmbedding) -> bool:
# logger.info('--- Main ---')
# --- Clear
try:
shutil.rmtree('./out/')
except FileNotFoundError:
pass
os.mkdir('./out')
# --- Init
solver.initialize_embedding()
save_embedding(*solver.get_embedding(), d, 'initial',
title=f'Initial embedding')
dp.save_current_degree_percentages(-1, solver._embedding)
if solver.found_embedding():
logger.info('🎉 Directly found embedding after initialization')
print('🎉 Directly found embedding after initialization')
# save_final(d)
output_embedding(*solver.get_embedding(), d)
return True
# --- Start solver
for i in range(max_generations):
if stop:
print('Stop spawning new generations')
break
child = do_one_generation(i, solver)
if not child:
logger.info('🔳 Stopping algorithm...')
return False
solver.commit(child)
# Save embedding every x steps
save_embedding_steps = 1
if (i % save_embedding_steps == 0) \
or (i == max_generations - 2) or (i == max_generations - 1):
save_embedding(*solver.get_embedding(), d, str(i),
title=f'Generation {i}')
# Save degree percentage data
dp.save_current_degree_percentages(i, solver._embedding)
# Check if done
if child.is_valid_embedding():
save_embedding(*solver.get_embedding(), d, str(i),
title=f'Generation {i} (final)')
child.remove_redundancy()
save_embedding(*solver.get_embedding(), d, f'{i}final',
title=f'Generation {i} (final with redundancy removed)')
logger.info('🎉🎉🎉🎉🎉🎉 Found embedding')
print('🎉🎉🎉🎉🎉🎉 Found embedding')
return True
else:
logger.info('✅ Generation passed')
return False
def do_one_generation(i: int, solver: EmbeddingSolver) -> Optional[Embedding]:
logger.info('')
logger.info(f'🔄 Generation: {i}')
child = solver.generate_population_and_select(params)
if not child:
return None
# Leave "room" on graph for next generation
if random() < remove_redundancy_probability:
child.remove_redundancy()
return child
################################ Output ########################################
def output_embedding(nodes, edges, mapping_G_to_H, d: DrawEmbedding):
logger.info('*** Embedding ***')
logger.info(nodes)
logger.info(edges)
logger.info(mapping_G_to_H)
d.draw_chimera_and_embedding(nodes, edges, mapping_G_to_H)
d.show_embedding()
def save_embedding(nodes: set[int], edges: set[tuple[int, int, int]],
mapping_G_to_H, d: DrawEmbedding, i: str, title=''):
logger.info('')
logger.info('🎈 Current embedding')
logger.info(f'edges: {edges}')
logger.info(f'mapping_G_to_H: {mapping_G_to_H}')
d.draw_whole_embedding_step(nodes, edges, mapping_G_to_H, title=title)
d.save_and_clear(f'./out/{i}.svg')
def save_final(d: DrawEmbedding) -> None:
logger.info('Save final')
pass
# d.save_and_clear(f'./out/steps.svg')
################################ Main ##########################################
if __name__ == "__main__":
signal.signal(signal.SIGINT, signal_handler)
main_loop()