<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with nodes labeled 0, 1, 2 and weighted edges from 0 to 1, 1 to 2, and 2 to 0, all with weight 1.0, how can you compute the directed Laplacian matrix using NetworkX?
### Response:
import networkx as nx
from networkx.linalg.laplacianmatrix import directed_laplacian_matrix

# Create a DiGraph
G = nx.DiGraph()
G.add_weighted_edges_from([(0, 1, 1.0), (1, 2, 1.0), (2, 0, 1.0)])

# Compute the directed Laplacian matrix
L = directed_laplacian_matrix(G, nodelist=[0, 1, 2], weight='weight', walk_type=None, alpha=0.9)

print(L)
<|EOT|>
