How can you check if a sequence of nodes exists in an undirected graph, where each node is adjacent to the next?

Question

I have an undirected graph of letters in a rectangular format, where each node has an edge to the adjacent neighboring node. For example:

d x f p
o y a a
z t i b