A general-purpose lightweight C++ graph library

Simple implementation of the a-star algorithm in Python 🌟

GAL-DAWN: An Novel High performance computing Library of Graph Algorithms based on DAWN, CUDA/C++

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths

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

Contraction Hierarchies (with bidirectional version of Dijkstra's algorithm) technique for computing shortest path in graph.

python package for fast shortest path computation on 2D polygon or grid maps

The BMSSP algorithm

Javascript solution code + test suite for the Shortest Path Problem, using Dijkstra's Algorithm.

This is a three dimensional pathfinding algorithm visualizer project.

A Python package to find the shortest path in a graph using Ant Colony Optimization

Pathfinding Visualizer application that visualizes graph based search algorithms used to find the shortest path. Algorithms used: Breadth first search, Depth first search, Best first search and A* search made with java swing

Easy-Path-finder is A Web App built using Streamlit and A* Algorithem to find the shortest path between two points in a City

Source codes for the Data Structures and Algorithms in C++ and Java book

Source codes for the Data Structures and Algorithms in C++ and Java book

Rectangular maze solving using image processing with OpenCV and numpy.

The successful and effective management of a busy and complex warehouse relies upon the control and location of stock within the warehouse. It is essential that stock is located in the most suitable locations, to optimize storage capability and increase resource efficiency. It is critical that the warehouse team has control and visibility at all times. A warehouse needs to be defined in multiple ways to reflect your individual characteristics, with your own location descriptions. The warehouse management system is a combinatorial optimization problem, where given a map (a set of racks and their positions in a warehouse), one wants to find an order for visiting the corresponding racks in such a way that the distance is minimal. Warehouse operational costs are heavily influenced by the efficiency in which workers are able to traverse the warehouse and gather items on orders around the warehouse that must be shipped to customers. The act of traversing the warehouse is greatly optimized by finding a shortest path possible to collect the order from the specified rack position .The main goal of Warehouse Management System is to ensure consistent availability of supplies for consumers. In general, there are two issues in optimizing a system: where in the warehouse each rack should be located and also to find an optimized possible path to retrieve the order. Therefore, we propose an implementation of a warehouse management system based on Dijkstra’s Algorithm to find the best shortest path.

Data Structures & Algorithms

Tehran metro stations api

📈 Online Algorithm Visualiser for Pathfinding Algorithms

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

A C++ implementation of famous graph-based algorithms.

Julia implementation of (resource) Constrained Shortest Path algorithms

A collection of open-source projects on the Traffic Assignment Problem

Python implementation of Dijkstra and Bi-Directional Dijkstra using heap and priority queues in python

The pathfinding implementation in the Unreal Engine 5

modern mathematical graph/network library written in PHP

AI search algorithm for finding shortest path

Small Function Code in Python for implementing Djikstra Algorithm (Shortest Path Algorithm). Can be integrated in big code as a function

Maze-solving bot