我使用gds的算法
MATCH (source:公司名称{name: ‘湖南拓天’}), (target:对外投资{name: ‘安阳东方’})
CALL gds.shortestPath.dijkstra.stream(‘myGraph’, {
sourceNode: source,
targetNode: target
})
YIELD index, sourceNode, targetNode,nodeIds,path
RETURN
index,
gds.util.asNode(sourceNode).name AS sourceNodeName,
gds.util.asNode(targetNode).name AS targetNodeName,
[nodeId IN nodeIds | gds.util.asNode(nodeId).name] AS nodeNames,
nodes(path) as path
ORDER BY index
使用gds的最短路径算法，找湖南拓天和安阳东方之间的最短路径，没有任何返回，是需要两个节点之间的边是同一个方向吗
