Finding all nodes connected to a vertex in Prolog

Question

I am curious about pathfinding algorithms, so I took a look at Dijkstra\'s. I\'m using this video as a guide (and it\'s what I\'m basing my graph on). Here is the graph I am