A collection of algorithms and data structures

Open source routing engine for OpenStreetMap. Use it as Java library or standalone web server.

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.

Data Structures and Algorithms in Java

Modular and modern graph-theory algorithms framework in Java

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

Five Java projects assigned for the Data Structures and Algorithms (CMPE 250) course in the Fall 2021-22 semester.

2017华为软件精英挑战赛初赛、复赛、决赛代码。（最终排名总决赛第14名）

Fundamental computer science algorithms and preparation for computing contests.

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

图论学习相关笔记，包含算法java实现。

Computer Science subject module at Roskilde University. Was made as part of a 15ETCS course where we applied Different Pathfinding strategies to solve shortest path problem. Contains Dijkstra and A* implemented in Java with a JavaFX User Interface to demonstrate shortest path visualization. Note: this project is not maintained

Algorithms and Data structures final project

ALT algorithms on a grid graph used for routing on the sea.

Algoritmos de Grafos. Grafos No Dirigidos No Ponderados y Ponderados. Grafos Dirigidos Ponderados. Coloreo de Grafos con algoritmos Secuencial Aleatorio, Welsh-Powell y Matula. Algoritmos de Dijkstra, Prim, Kruskal, Floyd, Warshall. Búsqueda en Profundidad (DFS) y Búsqueda en Anchura (BFS).

安卓图形化最短路径求解 (无向图+迷宫)，二维码扫描

🛰️ Real-world navigation based on open source spatial data and pathfinding algorithms

My implementation of useful data structures, algorithms, as well as my solutions to programming puzzles.

This is a simple implementation of the famous Dijkstra.