/CSE2003-Pathfinding-visualizer

A data structures project as part of CSE2003-Data structures and Algorithms course in VIT Chennai. This project is based on various shortest path algorithms that are visualized with the help of HTML and JS

Primary LanguageJavaScript

Pathfinding-visualizer

A data structures project as part of CSE2003-Data structures and Algorithms course in VIT Chennai. This project is based on various shortest path algorithms that are visualized with the help of HTML and JS.

Algorithms used

  • Greedy Algorithm
  • A* algorithm
  • Dijkstra's Algorithm

    Procedure

    To Run the code, open index.html
    By default, the code runs dijkstra's algorithm. To run others, comment the rest accordingly. .