Competitive Programming templates that I used during the past few years.

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).

Graph Theory algorithms: Vertex Coloring, Bellman-Ford, Dijkstra's, Hopcroft-Karp, Prim's, Topological Sorting, Floyd-Warshall

Optimization solvers in pure Python: LP, MILP, SAT, constraint programming, graph and metaheuristics. No dependencies. Solvor all your optimization needs.

Algorithms and Data Structures a comprehensive collection of fundamental Algorithms and Data structures organized into various categories to cater to the needs of software engineers and computer science students.

Node.js implementation of Dijkstra & Floyd-Warshall Algorithms

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).

Algoritmos de Grafos: Flujo Mínimo, Floyd-Warshall, Ruta Crítica(CPM, PERT), Dijkstra, Kruskal y aceleración de proyectos

Discrete mathematics course projects in the bachelor's degree(computer engineering).

Parallel implementations of Floyd-Warshall

A collection of some of the most frequently used Algorithms in C++ and Python

Several classical algorithms in graph theory, using NetworkX to simply visualize results.

🚚 University Project - Algorithm Design and Analysis - Garbage Truck Route Generation

Application to find shortest distance or duration or (fake price) of connecting flights through Floyd-Warshall algorithm.

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

A motion planning solution for PHP.

The program provides the products of any cargo company to its customers from the point of departure (dynamically entered by the user). it finds 5 additional shortcuts for the shortest route. The Floyd-Warshall algorithm is used in the solution of the problem.

CUDA implementation of Floyd-Warshall algorithm

A collection of graph algorithms in Rust.