Skip to content

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

Notifications You must be signed in to change notification settings

CK-ghub/CSE2003-Pathfinding-visualizer

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 

Repository files navigation

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. .

  • About

    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

    Topics

    Resources

    Stars

    Watchers

    Forks

    Releases

    No releases published

    Packages

    No packages published