<｜begin▁of▁sentence｜>### Instruction:
Given the Political blogs Graph which you can read from a gml file named polblogs.gml, can you use the Louvain method to perform community detection using cdlib and then calculate and print the number of edges internal to each community?
### Response:
import networkx as nx
from cdlib import algorithms, evaluation

# Read the graph
G = nx.read_gml('polblogs.gml')

# Perform community detection
communities = algorithms.louvain(G)

# Evaluate the number of edges inside each community
edges_inside_score = evaluation.edges_inside(G, communities)

# Print the result
print(edges_inside_score)
<|EOT|>
