Skip to content

Latest commit

 

History

History
41 lines (28 loc) · 913 Bytes

File metadata and controls

41 lines (28 loc) · 913 Bytes

Pathfinding 📍

Visualization of pathfinding algorithms

Table of Contents

Motivation

Supplementary visualization of the algorithms to the lecture given in the seminar Algorithms and Data Structures.

About the Project

Features

  • Pathfinding algorithms:
    • A*
    • IDA*
    • Dijkstra
  • Heuristic Distances:
    • Manhattan
    • Euclidean

Build with

  • JS Canvas

Usage

  1. Choose the appropriate algorithm and heuristic
  2. Build walls by point and click on tiles
  3. Press start button to start the algorithm

alt text

  1. Press reset button to reset the visualization