A discrete-time Python-based solver for the Stochastic On-Time Arrival routing problem

Java Code for Contraction Hierarchies Algorithm, A-Star Algorithm and Bidirectional Dijkstra Algorithm. Tested and Verified Code.

The Vehicle Monitoring And Routing System (VMARS) makes use of GPS to provide the exact location of the vehicle. It allows a parent to monitor the vehicle in real-time using a GPS-based device possessed by its driver. It is also capable of finding the shortest route to reach the destination passing through all the checkpoints which uses our prop…

Given a fleet of drones, a list of customer orders, and availability of the individual products in warehouses, schedule the drone operations so that the orders are completed as soon as possible.

Cobweb is a multi-modal journey planner offering a server based REST API and a light frontend.

An interactive HTML5 canvas graph that shows the shortest path between any two nodes.

Dijkstra's Algorithm

Project Home Delivery Management System implements Travelling Sales Man problem with many extended features such as calculate estimated distance, time, cost, shortest delivery route and send it to the Delivery boy present in Queue

path finding

A full-stack web application for navigation of the University of Washington Campus that enables shortest-route calculation between buildings and other locations. Builds off the existing, limited University of Washington Campus Map web application in a highly scalable and campus-oriented way.

PathWeaver is an API for creating path-networks like road- or traffic-networks. It offers method like computing shortest paths.

Implementation of Dijkstra Graph Algorithm in Python

Round table arrangemnet solution using greedy, Astar and UCS algorithms on graph data structure.

A Repository to store implementation of some of the famous Data Structures and Algorithms (mainly in C/C++/Java/Python) for everyone to learn and contribute.

Advance Computer Networks

A cab company software used to track and monitor cab bookings developed using C++, C graphics, graph data structure and Dijkstra's algorithm.

Реализация алгоритма Дейкстры для поиска кратчайшего пути между двумя вершинами и оптимального маршрута на 3D поверхности с использованием очереди с приоритетом (PriorityQueue).

This assignment was done as part of the COL334 course requirements. The objective of the assignment is to get familiar with the OpenFlow APIs and implement key networking policies : Hub Controller, Learning Switch, Spanning Tree, Shortest-Path Routing and Congestion-aware Shortest-Path Routing.

PDSA Assignment

USC-Foundations of Artificial Intelligence Codes