Tracking issue for shipping graphistry.std..\n\nImplementation is complete in draft PR #2006: https://github.com/graphistry/pygraphistry/pull/2006\n\n## Design\n\nstd is a concrete built-in implementation, not a dispatcher. It runs the same dataframe kernel semantics on the engine holding the graph and does not silently change algorithms based on optional libraries or hardware. Existing cugraph., igraph., and nx. procedures remain supported and cover many algorithms outside this five-procedure surface.\n\n## Completed\n\n- [x] WCC, fixed-iteration PageRank, CDLP, weighted SSSP, and deterministic-seed MIS kernels\n- [x] CALL graphistry.std.* graph-write and row-returning forms\n- [x] options maps, output-column overrides, and unknown-procedure validation\n- [x] original node-ID mapping for WCC/CDLP and SSSP sources\n- [x] explicit isolated-node preservation and MIS self-loop normalization\n- [x] truthful schema effects: PageRank float64, SSSP float32, MIS bool, WCC/CDLP caller-ID-dependent\n- [x] GFQL user documentation for syntax, options, semantics, and status\n- [x] local code-level validation: 159 passed, 6 skipped in the focused std/CALL/schema subset; full lint and docs Unicode checks pass\n- [x] product CI and Read the Docs checks pass\n\n## Evidence boundaries\n\nThe procedures implement documented Graphalytics-style semantics, but they are not official or audited LDBC Graphalytics submissions. MIS is not an official Graphalytics algorithm. Product documentation and PR #2006 intentionally make no benchmark speed claims.\n\nGuarded performance and parity work is tracked separately in pyg-bench PR #193: https://github.com/graphistry/pyg-bench/pull/193\n\n## Remaining\n\n- [ ] review and merge draft PR #2006\n
Tracking issue for shipping
graphistry.std..\n\nImplementation is complete in draft PR #2006: https://github.com/graphistry/pygraphistry/pull/2006\n\n## Design\n\nstdis a concrete built-in implementation, not a dispatcher. It runs the same dataframe kernel semantics on the engine holding the graph and does not silently change algorithms based on optional libraries or hardware. Existingcugraph.,igraph., andnx.procedures remain supported and cover many algorithms outside this five-procedure surface.\n\n## Completed\n\n- [x] WCC, fixed-iteration PageRank, CDLP, weighted SSSP, and deterministic-seed MIS kernels\n- [x]CALL graphistry.std.*graph-write and row-returning forms\n- [x] options maps, output-column overrides, and unknown-procedure validation\n- [x] original node-ID mapping for WCC/CDLP and SSSP sources\n- [x] explicit isolated-node preservation and MIS self-loop normalization\n- [x] truthful schema effects: PageRank float64, SSSP float32, MIS bool, WCC/CDLP caller-ID-dependent\n- [x] GFQL user documentation for syntax, options, semantics, and status\n- [x] local code-level validation: 159 passed, 6 skipped in the focused std/CALL/schema subset; full lint and docs Unicode checks pass\n- [x] product CI and Read the Docs checks pass\n\n## Evidence boundaries\n\nThe procedures implement documented Graphalytics-style semantics, but they are not official or audited LDBC Graphalytics submissions. MIS is not an official Graphalytics algorithm. Product documentation and PR #2006 intentionally make no benchmark speed claims.\n\nGuarded performance and parity work is tracked separately in pyg-bench PR #193: https://github.com/graphistry/pyg-bench/pull/193\n\n## Remaining\n\n- [ ] review and merge draft PR #2006\n