diff --git a/data-explorer/kusto/query/graph-mark-components-operator.md b/data-explorer/kusto/query/graph-mark-components-operator.md index 66c0ab2a71..f5e15629c4 100644 --- a/data-explorer/kusto/query/graph-mark-components-operator.md +++ b/data-explorer/kusto/query/graph-mark-components-operator.md @@ -3,7 +3,7 @@ title: graph-mark-components operator (preview) description: Learn how to use the graph-mark-components operator to find and mark all connected components of a graph. ms.reviewer: royo ms.topic: reference -ms.date: 05/25/2025 +ms.date: 05/24/2026 --- # graph-mark-components operator (preview) @@ -22,7 +22,7 @@ The `graph-mark-components` operator finds all connected components of a graph a | Name | Type | Required | Description | |--|--|--|--| -| *G* | string | :heavy_check_mark: | The graph source. | +| *G* | graph | :heavy_check_mark: | The graph source. | | *Kind* | string | | The connected component kind, either `weak` (default) or `strong`. A weak component is a set of nodes connected by a path, ignoring the direction of edges. A strong component is a set of nodes connected in both directions, considering the edges' directions. | | *ComponentId* | string | | The property name that denotes the component identifier. The default property name is `ComponentId`. | diff --git a/data-explorer/kusto/query/graph-match-operator.md b/data-explorer/kusto/query/graph-match-operator.md index 942a1ca74c..f6936a2bfd 100644 --- a/data-explorer/kusto/query/graph-match-operator.md +++ b/data-explorer/kusto/query/graph-match-operator.md @@ -3,7 +3,7 @@ title: graph-match operator description: Learn how to use the graph-match operator to search for all occurrences of a graph pattern in a graph. ms.reviewer: rocohen ms.topic: reference -ms.date: 02/17/2025 +ms.date: 05/24/2026 --- # graph-match operator @@ -22,7 +22,7 @@ The `graph-match` operator searches for all occurrences of a graph pattern in an | Name | Type | Required | Description | |--|--|--|--| -| *G* | `string` | :heavy_check_mark: | The input graph source. | +| *G* | `graph` | :heavy_check_mark: | The input graph source. | | *Pattern* | `string` | :heavy_check_mark: | One or more comma delimited sequences of graph node elements connected by graph edge elements using graph notations. See [Graph pattern notation](#graph-pattern-notation). | | *Constraints* | `string` | | A Boolean expression composed of properties of named variables in the *Pattern*. Each graph element (node/edge) has a set of properties that were attached to it during the graph construction. The constraints define which elements (nodes and edges) are matched by the pattern. A property is referenced by the variable name followed by a dot (`.`) and the property name. | | *Expression* | `string` | :heavy_check_mark: | The `project` clause converts each pattern to a row in a tabular result. The project expressions must be scalar and reference properties of named variables defined in the *Pattern*. A property is referenced by the variable name followed by a dot (`.`) and the attribute name. | diff --git a/data-explorer/kusto/query/graph-shortest-paths-operator.md b/data-explorer/kusto/query/graph-shortest-paths-operator.md index 4c45ec9c9c..bc5e29c072 100644 --- a/data-explorer/kusto/query/graph-shortest-paths-operator.md +++ b/data-explorer/kusto/query/graph-shortest-paths-operator.md @@ -23,7 +23,7 @@ The `graph-shortest-paths` operator finds the shortest paths between a set of so | Name | Type | Required |Description | |---------------|-------------|----------|-----------------------------| -| *G* | string | :heavy_check_mark: | The graph source, typically the output from a `make-graph` operation. | +| *G* | graph | :heavy_check_mark: | The graph source, typically the output from a `make-graph` operation. | | *Pattern* | string | :heavy_check_mark: | A [path pattern](#path-pattern-notation) that describes the path to find. Patterns must include at least one variable length edge and can't contain multiple sequences. | | *Predicate* | expression | | A boolean expression that consists of properties of named variables in the pattern and constants. | | *Expression* | expression | :heavy_check_mark: | A scalar expression that defines the output row for each found path, using constants and references to properties of named variables in the pattern. | diff --git a/data-explorer/kusto/query/graph-to-table-operator.md b/data-explorer/kusto/query/graph-to-table-operator.md index 9148292f93..b76758658a 100644 --- a/data-explorer/kusto/query/graph-to-table-operator.md +++ b/data-explorer/kusto/query/graph-to-table-operator.md @@ -3,7 +3,7 @@ title: graph-to-table operator description: Learn how to use the graph-to-table operator to export nodes or edges from a graph to tables. ms.reviewer: alexans ms.topic: reference -ms.date: 08/11/2024 +ms.date: 05/24/2026 --- # graph-to-table operator @@ -29,10 +29,14 @@ The `graph-to-table` operator exports nodes or edges from a graph to tables. |Name|Type|Required | Description | |---|---|---|---| -|*G*| `string` | :heavy_check_mark:|The input graph source.| -|*NodesTableName*| `string` ||The name of the exported nodes table.| -|*EdgesTableName*| `string` ||The name of the exported edges table.| -|*ColumnName*| `string` ||Export the node hash ID, source node hash ID, or target node hash ID with the given column name.| +|*G*| `graph` | :heavy_check_mark:|The input graph source.| +|*NodesTableName*| `identifier` ||The name of the exported nodes table.| +|*EdgesTableName*| `identifier` | |The name of the exported edges table.| +|*ColumnName*| `identifier` ||Export the node hash ID, source node hash ID, or target node hash ID with the given column name.| + +> [!NOTE] +> +> At least one of *NodesTableName* or *EdgesTableName* is required to output nodes and edges. ## Returns