Skip to content

Optimization in pathFinding.py #1

Description

@Markus28
  • Use dictionary comprehension for init of map
  • Use pointer to previous node instead of entire path, backtrack if necessary
  • Use siftdown instead of heapify
  • Use list of adjacent nodes instead of map
  • (Use Cython for critical parts)

Activity

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

Metadata

Metadata

Assignees

Labels

No labels
No labels

Projects

No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions