• Onion Architecture
    • SOLID
    • Dependency Injection
      • Linked List
      • Array
    • Hash table
    • Heap
      • Quick Sort
      • Dijkstra's Algorithm
      • A* algorithm
    • Euclidean algorithm
      • Concept
      • WebSockets with Javascript
      • Concept
      • Concept
      • RabbitMQ
      • RabbitMQ with Java
      • Concept
      • Concept
      • Generate Document
      • Java CLI
      • Annotations
      • Graalvm
      • Troubleshooting
      • Operator: this
        • Troubleshooting
      • Clang
      • RAII
      • Ngrx
      • Cross-Origin Resource Sharing
      • RSA - Encryption
      • Diffie-Hellman key exchange
      • Basics
      • Mocking
      • Basics
      • Basics
    • Wsl
    • Git
      • Event
      • COLL Advent of Code - Solvinglibrary
    • Swiss Hacking Challenge
  • book Glossary
    • GitHub
    • RSS
    • Deutsch
    • Home
    • Algorithms & Data structures
    • Pathfinding algorithms
    On this page
    route

    Pathfinding algorithms

    route

    Dijkstra's Algorithm

    Description, functionality and implementation of Dijkstra's Algorithm

    route

    A* algorithm

    Description of the A* algorithm and its functionality.

    © 2025 Liam Metzger.
    Built with Lotus Docs