Neo4j GDS 1.4.1 K生成树的问题

Question

我在https://neo4j.com/docs/graph-data-science/current/alpha-algorithms/minimum-weight-spanning-tree/上关注Noe4j的在线文档，似乎查询K-生成树的密码不起作用：

MATCH (n:Place)
WITH n.id AS Place, n.kminst AS Partition, count(*) AS count
WHERE count = 3
RETURN Place, Partition

它是否应该修改为以下内容？

MATCH (n:Place)
WITH n.kminst AS Partition, count(*) AS count
WHERE count = 3
MATCH (n:Place)
WHERE n.kminst=Partition
RETURN n

我从https://resources.oreilly.com/examples/0636920233145/tree/master/data下载了<Graph Algorithms>这本书的示例传输数据，并将其加载到图形库中，包中的所有路径算法都可以，除了K-生成树之外，不知道如何使其工作。

MATCH (source:Place {id: "Amsterdam"})
CALL gds.alpha.spanningTree.kmin.write({
     nodeProjection:'Place',
     relationshipProjection:{
     EROAD:{
         type:'EROAD',
         properties:'distance',
         orientation:'NATURAL'
     }},
     startNodeId:id(source),
     relationshipWeightProperty:'distance',
     writeProperty: 'kminst',
     k: 3
})
YIELD createMillis, computeMillis, writeMillis, effectiveNodeCount
RETURN createMillis, computeMillis, writeMillis, effectiveNodeCount

MATCH (n:Place)
WITH n.kminst AS partition, count(*) AS count
RETURN partition, count

没有分区获取值3，所以不知道如何使用这样的Cypher来提取结果：

MATCH (n:Place)
WITH n.kminst AS Partition, count(*) AS count
WHERE count = 3
MATCH (n:Place)
WHERE n.kminst=Partition
RETURN n

任何想法都是值得欣赏的。

Answer 1

好的，得到普里姆算法只适用于无向图的密钥，应该在the algorithm document中提到。在https://github.com/neo4j/graph-data-science/blob/master/alpha/alpha-algo/src/main/java/org/neo4j/graphalgo/impl/spanningTrees/Prim.java上阅读Prim算法的源代码。