<｜begin▁of▁sentence｜>### Instruction:
Given a list of fitness values for each vertex [2, 1, 1.5, 3, 0.5, 2.5, 1.2], can you generate a non-growing graph where the edge probabilities are proportional to the node fitnesses using the igraph library?
### Response:
import igraph as ig

# Define the fitness for each vertex
fitnesses = [2, 1, 1.5, 3, 0.5, 2.5, 1.2]

# Generate the graph
fitness_graph = ig.Graph.Static_Fitness(fitnesses)

# Print the summary of the generated graph
print(fitness_graph.summary())

# Save the structure to 'fitness_graph.gml'
fitness_graph.write_gml('fitness_graph.gml')
<|EOT|>
