Skip to content
This repository was archived by the owner on Jan 26, 2026. It is now read-only.

Graph Pattern Matching: SHORTEST k GROUPS #9

Open
Open
Graph Pattern Matching: SHORTEST k GROUPS#9
Labels
Could HaveFor a milestone, this is optional or nice-to-haveenhancementNew feature or request
Milestone
ISO-GQL Mandatory Features

Description

@akollegger
akollegger
opened on Nov 12, 2025

API

Other

Description

To return all paths that are tied for first, second, and so on up to the kth shortest length

MATCH p = SHORTEST 2 GROUPS (wos:Station)-[:LINK]-+(bmv:Station)

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Labels

    Could HaveFor a milestone, this is optional or nice-to-haveenhancementNew feature or request

    Type

    No type

    Projects

    No projects

      Milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions