Implementation of Algorithms and Data Structures, Problems and Solutions

Hipster4j is a lightweight and powerful heuristic search library for Java and Android. It contains common, fully customizable algorithms such as Dijkstra, A* (A-Star), DFS, BFS, Bellman-Ford and more.

Modular and modern graph-theory algorithms framework in Java

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

Source code for the HappyCoders.eu articles on pathfinding and shortest path algorithms (Dijkstra, A*, Bellman-Ford, Floyd-Warshall).

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.

A graph algorithms visualizer written in Java visualizing the solution of the Strong Connectivity, Cycle Detection and Shortest Path problems

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

Spring Boot Neo4j Shortest Path

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

Currency Arbitrage solution with graphs

Android App for simulating Dijkstra and A* algorithms through intuitive animations

This repository contains all the solutions of assignments, starter files and other materials related to this specialization.

A graphical tool to simulate robot path planning with obstacles using two different algorithms : Dijkstra and A*

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

Data structure course project about implementing graphs and applying graph-based algorithms on it

This project aims to take the shortest route to all selected cities and return to the starting city. It uses the dijikstra algorithm while calculating the shortest path.

Solving the problem « Who killed the Duke of Densmore? » with graphs and Java.

A Software Defined Networking layer-3 routing application that constructs route tables based on a global view of the network topology.

A social network and metro system representation - Shortest path problem