A indoor navigation app for Graphic Era Hill University using Dijkstra algorithm
-
Updated
Apr 30, 2025 - JavaScript
A indoor navigation app for Graphic Era Hill University using Dijkstra algorithm
This project aims to plan the routes for an electric vehicle fleet while taking into account the constraints of battery recharging. The program Uses advanced algorithms and graph-based techniques in C++ and allows users to generate efficient route plans based on the provided inputs.
A complete Java implementation of lab exercises from the Design and Analysis of Algorithms (DAA) course (Course Code: 23CS253), aligned with the VTU syllabus. Covers brute-force, divide and conquer, greedy, dynamic programming, and backtracking strategies—complete with problem statements, code, and performance analysis plots.
This is a implementation of Dijkstra Algorithm using P5.js
A C Program To Find The Nearest Police Station And Tell The Shortest Route To Reach The Required Location Of A Hypothetical City (Based On Dijkstra's Algorithm)
A complete Java implementation of lab exercises from the Design and Analysis of Algorithms (DAA) course (Course Code: 23CS253), aligned with the VTU syllabus. Covers brute-force, divide and conquer, greedy, dynamic programming, and backtracking strategies—complete with problem statements, code, and performance analysis plots.
Add a description, image, and links to the dijkastra-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the dijkastra-algorithm topic, visit your repo's landing page and select "manage topics."