Detects arbitrage opportunities across 131 cryptocurrency exchanges in 50 countries

Leverage the power of modern C++ to build robust and scalable applications

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

GraphLab is an application that shows visually how several graph algorithms work

Library for functional graph & geometry algorithms

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

Parallel implementations of Bellman-Ford algorithm with MPI, OpenMP and CUDA.

Bellman Ford Algorithm Implementation using Python

CUDA implementation of the Bellman-Ford's algorithm.

A program to find the path through a network of nodes.

BFM Unity (https://www.bfm-unity.com/) (https://guhhhhaa.gitbook.io/bfm/) is neutral politically, economically and worldwide. It is a decentralized financial and economic continuum of dissipative structure clusters, formed by distributed self-organization of modular units of microeconomic structures driven by intelligent algorithms.

Algoritmo de Dijkstra e algoritmo Bellman-ford que resolve o problema dos caminhos mínimos (python)

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

This repository will hold source codes for different classic algorithms in computer science

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

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

A k-shortest routes algorithm for urban public transportation network

A k-shortest routes algorithm (implemented in MATLAB)

Proiectarea Algoritmilor - UPB 2019

🌳 Simulation of a spanning tree protocol