Update cpp/common/src/codingstandards/cpp/graph/GraphPathStateSearch.qll

mbaluda · Copilot · web-flow · commit 729554b13d94 · 2026-02-20T11:15:28.000+01:00
Co-authored-by: Copilot &lt;175728472+Copilot@users.noreply.github.com&gt;
diff --git a/cpp/common/src/codingstandards/cpp/graph/GraphPathStateSearch.qll b/cpp/common/src/codingstandards/cpp/graph/GraphPathStateSearch.qll
@@ -8,7 +8,7 @@
  * instance, we could use this graph to find recursive functions, which requires knowing how an end
  * node was reached from a start node (the state).
  *
- * Like `GraphPathSearch`, this module uses forward-reverse pruning, wihch is a pattern that is
+ * Like `GraphPathSearch`, this module uses forward-reverse pruning, which is a pattern that is
  * useful for efficiently finding connections between nodes in a directional graph. In a first pass,
  * it finds nodes reachable from the starting point. In the second pass, it finds the subset of
  * those nodes that can be reached from the end point. Together, these create a path from start

Original file line number	Diff line number	Diff line change
`@@ -8,7 +8,7 @@`
`8`	`8`	`* instance, we could use this graph to find recursive functions, which requires knowing how an end`
`9`	`9`	`* node was reached from a start node (the state).`
`10`	`10`	`*`
`11`		- * Like `GraphPathSearch`, this module uses forward-reverse pruning, wihch is a pattern that is
	`11`	+ * Like `GraphPathSearch`, this module uses forward-reverse pruning, which is a pattern that is
`12`	`12`	`* useful for efficiently finding connections between nodes in a directional graph. In a first pass,`
`13`	`13`	`* it finds nodes reachable from the starting point. In the second pass, it finds the subset of`
`14`	`14`	`* those nodes that can be reached from the end point. Together, these create a path from start`