<｜begin▁of▁sentence｜>### Instruction:
Given the Word Adjacencies graph from a GML file named adjnoun.gml, can you use the Louvain algorithm in cdlib to perform community detection? Can you then compute the fraction of community nodes that belong to a triad?
### Response:
import networkx as nx
from cdlib import algorithms, evaluation

# Read the graph from the GML file
g = nx.read_gml('adjnoun.gml')

# Detect communities using the Louvain algorithm
communities = algorithms.louvain(g)

# Evaluate the Triangle Participation Ratio
triangle_participation = evaluation.triangle_participation_ratio(g, communities)

# Print the result
print(triangle_participation.score)
<|EOT|>
