<｜begin▁of▁sentence｜>### Instruction:
Given two adjacency matrices A and B representing two graphs where each graph has 4 vertices, can you use the graph_match function from graspologic to find the best permutation of vertices that minimizes the edge disagreements between the two graphs? You should print the matched indices in A, the corresponding matched indices in B, and the overall score of the solution.
### Response:
import graspologic
import numpy as np

# Create two adjacency matrices representing our graphs
A = np.array([[0, 1, 0, 0],
              [1, 0, 1, 1],
              [0, 1, 0, 0],
              [0, 1, 0, 0]])

B = np.array([[0, 1, 1, 0],
              [1, 0, 0, 0],
              [1, 0, 0, 1],
              [0, 0, 1, 0]])

# Perform graph matching
result = graspologic.match.graph_match(A, B)

# Output results
print('Matched indices in A:', result.indices_A)
print('Matched indices in B:', result.indices_B)
print('Score:', result.score)
<|EOT|>
