在过去的几天里,我一直在尝试找到一种方法来计算两个节点之间的所有非循环路径。我一直在使用广度优先搜索和深度优先搜索。我相当肯定两者都可以完成这项任务。但是,我一直在努力研究如何调整下面的 DFS 代码以找到两个节点之间的所有可能路径。我尝试了一些不同的事情(记住数组中的节点,递归),但我没有正确实现它们并且无法输出可能的路径。
最终,我想返回一个数组数组,其中包含两个选定节点之间的所有可能路径。我可以做任何简单的修改来完成这个吗?下面的代码是我目前正在使用的。
function init(&$visited, &$graph){
foreach ($graph as $key => $vertex) {
$visited[$key] = 0;
}
}
/* DFS args
$graph = Node x Node sociomatrix
$start = starting node
$end = target node (currently not used)
$visited = list of visited nodes
$list = hold keys' corresponding node values, for printing path;
*/
function depth_first(&$graph, $start, $end, $visited, $list){
// create an empty stack
$s = array();
// put the starting node on the stack
array_push($s, $start);
// note that we visited the start node
$visited[$start] = 1;
// do the following while there are items on the stack
while (count($s)) {
// remove the last item from the stack
$t = array_pop($s);
// move through all connections
foreach ($graph[$t] as $key => $vertex) {
// if node hasn't been visited and there's a connection
if (!$visited[$key] && $vertex == 1) {
// note that we visited this node
$visited[$key] = 1;
// push key onto stack
array_push($s, $key);
// print the node we're at
echo $list[$key];
}
}
}
}
// example usage
$visited = array();
$visited = init($visited, $sym_sociomatrix);
breadth_first($sym_sociomatrix, 1, 3, $visited, $list);