A collection of sorting algorithms and data structures implemented in C++. Each algorithm and data structure comes with its own set of test cases to ensure correctness and robustness.

This project was developed by me and my friends as a mini project for DSA course.This is based on Javascript, BFS, Dijisktara

The ride-sharing simulation replicates services like Uber or Lyft, analyzing user demand, driver availability, and pricing dynamics for optimization.

Developing a maze solving robot in ROS2 that leverages information from a drone or Satellite's camera using OpenCV algorithms to find its path to the goal and solve the maze. :)

SafeNav: Waze's Safety Upgrade

This is an extension of the webpage similarity II project. This time, the GUI would include a section that allows you two find the path (wiki links) between any two different wiki link that you select from our database.

Simulation of Routing Algorithms used in communication networks in python

Path planning using Dijkstra's and A-star algorithms

This repository provides the implementaion of data structures in Java programming langauge

Users can book the car or any other vehicle and add other information for the user’s preference

Contains all answers for Rajalakshmi college's Digial cafe CS19341-Design and Analysis of Algorithms. HAPPY CODING !!!

Shortest path algorithm (Dijikstra's Algorithm) visualization using ReactJS

A CRUD based project made using C++ Data Strucures

Finding the shortest route between points on a city map

Find the shortest distance between 2 points on a map!

Visualize Dijkstra's algorithm on a 2D Grid

CA-GrQc.txt Analyzed Using Directed and Undirected Graphs

Directed Weighted Graph implementation in Python. This is the 4th assignment in OOP21 course in Ariel University.

This repository contains implementation for graph algorithms using an adjacency matrix. This was submitted as project two for ITCS 6114 Data Structures and Algorithms under the guidance of Dr. Dewan at the University of North Carolina at Charlotte, Fall 2021.