序言图深度优先搜索(prolog graph depth first search)

 我已经看到关于深度优先搜索的其他问题，但我的问题稍有不同，我真的不明白。 在序言中，我代表我的无向图： 
 
 [0-[1,5], 1-[0,2], 2-[1,3], 3-[2,0], 5-[0]] 
 
 这是一组键值，其中键表示节点和列表： -[]表示其邻居。 
 
 我不知道如何用这个模型进行深度优先搜索。 我尝试了很多解决方案。 我想要一个像这样的基本递归算法： 
 
dfs(v, visited):
  if visited[v] then return
  visited.insert(v)
  foreach neighbor of v:
    dfs(neighbor, visited)
 
 我在prolog中做不到的是pass作为一个可变引用，它将被每个邻居递归地修改为下一个邻居。 
 
 因为如果我把它翻译成序言： 
 
% here Graph contains the entire key-value pairs list,
% Node-Neighbor is the current node with its neighbors.
dfs(Graph, Node-Neighbors, Visited) :-
    \+ member(Node, Visisted),
    % Now here I could get the next neighbor within neighbor, like so:
    member(Node1,Neighbors),
    % Then gets its own neighbors too by:
    member(Node1-Neighbors1, Graph),
    % but here I'm stuck...
 
 我需要某种折叠，每个邻居都调用dfs，并将其结果传递给下一个邻居，但我不知道该怎么做...... 
 
 谢谢。 

I've seen other questions about depth first search but my problem is slightly different and I really don't get it. In prolog, I represent my undirected graph like this: 
 
[0-[1,5], 1-[0,2], 2-[1,3], 3-[2,0], 5-[0]]
 
Which is a set of key-value, where the key represents the node and the list: -[] represents its neighbors.
 
I don't know how to do a depth first search with this model. I've tried many solution. I want a really basic recursive algorithm like this one:
 
dfs(v, visited):
  if visited[v] then return
  visited.insert(v)
  foreach neighbor of v:
    dfs(neighbor, visited)
 
What I can't do in prolog is pass visited as a mutable reference which will be modified by each neighbor for the next neighbor recursively.
 
Because If I translate it into prolog:
 
% here Graph contains the entire key-value pairs list,
% Node-Neighbor is the current node with its neighbors.
dfs(Graph, Node-Neighbors, Visited) :-
    \+ member(Node, Visisted),
    % Now here I could get the next neighbor within neighbor, like so:
    member(Node1,Neighbors),
    % Then gets its own neighbors too by:
    member(Node1-Neighbors1, Graph),
    % but here I'm stuck...
 
I would need some kind of folding where each neighbors call dfs and its result is passed to the next neighbors, but I don't know how to do that...
 
Thanks.

原文：https://stackoverflow.com/questions/50766565