docs(kshortest): document the filter lambda for KSHORTEST

[imilinovic]

Release note

KSHORTEST path expansion now accepts a filter lambda. Documents the (r, n | ...) syntax with runnable examples, and replaces the "No filter lambdas" limitation with the two that remain: KSHORTEST orders by hop count and takes no weight lambda, and the three-argument (r, n, p | ...) form is not supported.

Related product PRs

PRs from product repo this doc page is related to:
memgraph/memgraph#4559

Checklist:

• Add appropriate milestone (current release cycle)
• Add bugfix or feature label, based on the product PR type you're documenting
• Make sure all relevant tech details are documented
  • Update reference pages (e.g. clauses, functions, flags, experimental, monitoring, Cypher differences)
  • Search for the feature you are working on (mentions) and make updates if needed
  • Provide a basic example of usage
  • In case your feature is an Enterprise one, list it under ME page and mark its page with Enterprise (example) — not Enterprise-only
• Check all content with Grammarly
• Perform a self-review of my code
• The build passes locally
• My changes generate no new warnings or errors

---

Notes for the reviewer:

• The only KSHORTEST mention outside this page is the "K shortest paths" section of Cypher differences, which makes no claim about lambdas — checked, no edit needed.
• Both new examples were run against a build of feat: support a filter lambda in KSHORTEST path expansion memgraph#4559 using the dataset already on the page: (r, n | n.name <> "B") leaves the single path A → C → E, and 2..4 |3 (r, n | n.name <> "D") leaves A → C → E and A → B → C → E.

[vercel]

The latest updates on your projects. Learn more about Vercel for GitHub.

Project	Deployment	Actions	Updated (UTC)
documentation	Ready	Preview	Aug 12, 2026 2:42pm