<｜begin▁of▁sentence｜>### Instruction:
Given two graphs represented by adjacency matrices A and B, with a known vertex of interest in Graph A and a known seeded match between the graphs, how can we use Vertex Nomination via Seeded Graph Matching (VNviaSGM) to rank the potential matches for the vertex of interest to the vertices in Graph B?
### Response:
import numpy as np
from graspologic.nominate import VNviaSGM

# Create adjacency matrices for two graphs (Graph A and Graph B)
A = np.array([[0, 1, 0],
              [1, 0, 1],
              [0, 1, 0]])
B = np.array([[0, 1, 1],
              [1, 0, 0],
              [1, 0, 0]])

# Vertex of interest in Graph A and known seed match between graphs
voi = 0
seedsA = [1]
seedsB = [2]

# Instantiate the VNviaSGM class
vnvia = VNviaSGM(order_voi_subgraph=1, order_seeds_subgraph=1)

# Fit the model to the graphs using the known seeds and vertex of interest
vnvia.fit(A, B, voi, seeds=[seedsA, seedsB])

# Print the nomination list (vertex in Graph B that matches VOI in Graph A)
print('Nomination list for vertex of interest from Graph A to Graph B:')
print(vnvia.nomination_list_)
<|EOT|>
