Graph.pm-如何获取具有特定长度的所有路径？

Question

我有以下带有9条边的示例图：

假设图形是无向的，并且每个边的权重为1。

我们可以使用Graph.pm以编程方式对其进行描述

use Graph::Undirected;
my $g = Graph::Undirected->new; # An undirected graph.
$g->add_edge(1, 3);
$g->add_edge(3, 4);
$g->add_edge(4, 2);
$g->add_edge(1, 2);
$g->add_edge(1, 5);
$g->add_edge(1, 2);
$g->add_edge(1, 6);
$g->add_edge(6, 2);
$g->add_edge(2, 7);

如何获取从顶点1到顶点2且长度= 2的所有路径？

我在Graph.pm中找不到任何方法：（

在我的示例中，它必须返回2条路径，[ 1, 5, 2 ]和[ 1, 6, 2 ]

Answer 1

您的边缘设置中有一个错误，请与我的正确定义进行比较。

use Graph::Undirected;
my $g = Graph::Undirected->new;
$g->add_edge(1, 2);
$g->add_edge(1, 3);
$g->add_edge(1, 5);
$g->add_edge(1, 6);
$g->add_edge(2, 7);
$g->add_edge(3, 4);
$g->add_edge(4, 2);
$g->add_edge(5, 2);
$g->add_edge(6, 2);

for my $neighbour_of_v1 ($g->neighbours(1)) {
    next if 2 == $neighbour_of_v1; # direct neighbour, path is too short
    for my $neighbour_of_neighbour_of_v1 ($g->neighbours($neighbour_of_v1)) {
        next if 1 == $neighbour_of_neighbour_of_v1; # ignore backlink to start
        say "1-$neighbour_of_v1-$neighbour_of_neighbour_of_v1"
            if 2 == $neighbour_of_neighbour_of_v1;
    }
}
__END__
1-5-2
1-6-2