Skip to content

N shortest paths should implicitly remove duplicates #117

@samblau

Description

@samblau

If a user asks for the 50 shortest paths from [A,B] to X, they should get 50 unique paths and not 50 paths including a whole bunch of duplicates. Every PR implicitly duplicates a path, so if a shortest path has multiple PRs, we'll get a lot of duplicates which all have the same cost.

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions