graph-shortest-paths 运算符（预览版）

适用于：✅Azure 数据资源管理器✅Azure Monitor✅Microsoft Sentinel

graph-shortest-paths 运算符查找一组源节点与图形中的一组目标节点之间的最短路径，并返回包含结果的表。

语法

G|graph-shortest-paths [output=OutputOption] PatternwherePredicateproject [ColumnName=] 表达式 [, ...]

参数

路径模式表示法

下表显示了支持的路径模式表示法。

可变长度边缘

可变长度边缘允许在定义的限制内多次重复的特定模式。 这种类型的边缘由星号（*）表示，后跟最小值..最大值格式的最小和最大出现值。 这些值必须是整数标量。 如果序列中的所有边缘满足 where 子句约束，则此范围中的任何边缘序列都可以匹配模式的可变边缘。

返回

graph-shortest-paths 运算符会返回表格结果，其中每个记录对应于图形中找到的路径。 返回的列使用模式中定义的节点和/或边缘属性在运算符的 project 子句中定义。 可变长度边缘的属性和函数作为动态数组返回。 数组中的每个值对应于可变长度边缘的一次出现。

示例

以下示例演示如何使用 graph-shortest-paths 运算符查找交通网络中的两个车站之间的最短路径。 该查询根据 connections 中的数据构造图形，并查找从 "South-West" 车站到 "North" 车站的最短路径，考虑最多五个连接长的路径。 由于默认输出为 any，因此它会找到任何最短路径。

let connections = datatable(from_station:string, to_station:string, line:string) 
[ 
  "Central", "North", "red",
  "North", "Central", "red", 
  "Central", "South",  "red", 
  "South", "Central",  "red", 
  "South", "South-West", "red", 
  "South-West", "South", "red", 
  "South-West", "West", "red", 
  "West", "South-West", "red", 
  "Central", "East", "blue", 
  "East", "Central", "blue", 
  "Central", "West", "blue",
  "West", "Central", "blue",
]; 
connections 
| make-graph from_station --> to_station with_node_id=station
| graph-shortest-paths (start)-[connections*1..5]->(destination)
  where start.station == "South-West" and destination.station == "North"
  project from = start.station, path = map(connections, to_station), line = map(connections, line), to = destination.station

输出

以下示例与前面的示例一样，查找运输网络中的最短路径。 但是，它使用 output=all，因此会返回所有最短路径。

let connections = datatable(from_station:string, to_station:string, line:string) 
[ 
  "Central", "North", "red",
  "North", "Central", "red", 
  "Central", "South",  "red", 
  "South", "Central",  "red", 
  "South", "South-West", "red", 
  "South-West", "South", "red", 
  "South-West", "West", "red", 
  "West", "South-West", "red", 
  "Central", "East", "blue", 
  "East", "Central", "blue", 
  "Central", "West", "blue",
  "West", "Central", "blue",
]; 
connections 
| make-graph from_station --> to_station with_node_id=station
| graph-shortest-paths output=all (start)-[connections*1..5]->(destination)
  where start.station == "South-West" and destination.station == "North"
  project from = start.station, path = map(connections, to_station), line = map(connections, line), to = destination.station

输出

相关内容