gregfelice commented on issue #2349: URL: https://github.com/apache/age/issues/2349#issuecomment-4282718478
Fair call — dropping the GUC. For the docs addition, I'll add a design-note comment block at the top of `src/backend/utils/adt/age_vle.c` explaining: - **Semantics** — edge-isomorphism (openCypher-mandated): no repeated edges per path, vertices may recur. Small triangle example showing why a visited-node optimization would be spec-incorrect. - **Cost model** — bounded `[*min..max]` is polynomial in graph size (bounded by C(E, max)); unbounded `[*]` / `[*1..]` is combinatorial in the worst case on cycle-rich graphs. - **Implementation pointer** — one-liner noting that cycle prevention is enforced via `edge_state_entry.used_in_path` + the DFS backtracking in `dfs_find_a_path_*()`, so future readers can find it. No code changes, no new tests. Will retitle this issue to "Docs: clarify VLE semantics and cost model" and submit the PR shortly. If you'd prefer the note in `age_vle.h` instead, or want a user-facing doc in `age-website` too, happy to adjust. -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected]
