<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with weighted edges [(0, 1, 5), (1, 2, 2), (2, 3, -3), (1, 3, 10), (3, 2, 8)], can you compute the all-pairs shortest path length matrix using Floyd’s algorithm with NetworkX, and represent the result as a NumPy array?
### Response:
import networkx as nx
import numpy as np

# Create a directed graph
G = nx.DiGraph()

# Add weighted edges
G.add_weighted_edges_from([(0, 1, 5), (1, 2, 2), (2, 3, -3), (1, 3, 10), (3, 2, 8)])

# Compute the shortest path length matrix using Floyd's algorithm
# The result is a NumPy array with shortest path distances
length_matrix = nx.floyd_warshall_numpy(G)

print(length_matrix)
<|EOT|>
