<｜begin▁of▁sentence｜>### Instruction:
Given a dictionary of dictionaries representing an adjacency list of a graph where the outer keys are source nodes, inner keys are target nodes, and the values are edge weights, can you convert this structure to a numpy adjacency matrix using NetworkX?
### Response:
import networkx as nx
import numpy as np

# Create a dictionary of dictionaries
adj_dict = {
    'a': {'b': 1, 'c': 2},
    'b': {'a': 1, 'c': 3},
    'c': {'a': 2, 'b': 3}
}

# Convert it to a numpy adjacency matrix
A = nx.to_numpy_array(adj_dict)

print(A)
<|EOT|>
