Harshini Suresha

RouteOpt

Graph-Based Route Optimization, Shortest-Path Algorithms & Efficient Data Structures

Year2024
LocationDept. of Computer Science
TagsDijkstra, A*, Bellman–Ford, Trie
LinksWebsiteAppGitHubColab
harshini-suresha.github.io/routeoptOpen harshini-suresha.github.io/routeopt ↗
Screenshot of the RouteOpt website

Dijkstra, A*, Bellman–Ford and BFS compared on maps of 36 to 100 locations (630 pairs), with tries for autocomplete, topological sort, and an interactive site that animates every search.

Jun 2024 – Aug 2024 at Dept. of Computer Science, PES University, supervised by Badri Prasad V R.

← Back