<｜begin▁of▁sentence｜>### Instruction:
Given a chordal graph with edge set [(1, 2), (1, 3), (2, 3), (2, 4), (3, 4), (3, 5), (3, 6), (4, 5), (4, 6), (5, 6), (7, 8)], and an isolated node 9, can you compute all maximal cliques using NetworkX?
### Response:
import networkx as nx
from networkx.algorithms.chordal import chordal_graph_cliques

# Create a chordal graph
G = nx.Graph()
G.add_edges_from([(1, 2), (1, 3), (2, 3), (2, 4), (3, 4), (3, 5), (3, 6), (4, 5), (4, 6), (5, 6), (7, 8)])
# Add an isolated node
G.add_node(9)

# Get all maximal cliques
cliques = [frozenset(c) for c in chordal_graph_cliques(G)]
for i, clique in enumerate(cliques):
    print(f'Clique {i}: {clique}')
<|EOT|>
