A indoor navigation app for Graphic Era Hill University using Dijkstra algorithm

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)

Multi-agent 3D path planning and autonomous drone mission planning algorithms implemented in Python.

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

High-performance Pathfinding Engine & PWA. Features a "Shift-Left" DevOps architecture with automated ESLint v10 verification, Trivy security auditing, and Node 22 LTS containerization. Benchmarks search heuristics (A, IDA, Dijkstra) with real-time complexity analysis and 60FPS DOM-optimized rendering.