Siddhesh Surve is an accomplished Engineering leader with topics of interest including AI, ML, DS, DE, Cloud compute.

Source code for the HappyCoders.eu articles on pathfinding and shortest path algorithms (Dijkstra, A*, Bellman-Ford, Floyd-Warshall). This project simulates real bus transportation systems, analyzes ...

Abstract: This paper examines the problem of parallelizing Dijkstra’s algorithm, as an algorithm for robot motion planning was a challenge to twist the algorithm in such a way so it can be executed in ...

Abstract: Dijkstra algorithm is a single-source shortest path algorithm, and the result is the shortest distance from the source node to the destination node. In the parking guidance process, the ...

A WebApp was created to solve for a case study on finding the shortest paths to deliver products and linearly assigning problem in a warehouse. The app is based on the Branch and Bound algorithm for ...

Richard Kangiama Lwangi *, Bavon Diemu Tshiband, Patrick Bokungu Efoto, Alfred Mukuna, Jean Ondontshia Nkoyi, Jean-Pierre Kalay Kut, Bruno Deko Oyema, Benjamin Safari Kachunga, Bigohe Nzana Rwubaka, ...