Data structures and algorithms in X minutes. Code examples from my YouTube channel.

👾 my mev solver running arbitrage strategies for CoW protocol (e.g., running nelder mead simplex optimization)

A brief summary of various algorithms. Each algorithm provides examples written in Python, Ruby and GoLang.

A Python implementation and visualization of various pathfinding and graph search algorithms.

Bellman Ford Algorithm Implementation using Python

Network Flows Optimization - Shortest Path, Max Flow and Min Cost Flow Algorithms in Python

Algorithm for identifying currency arbitrage opportunities

Data exploitation for graph algorithms - applied to Paris

Data Structures And Algorithms

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

Python tkinter graph algorithm with shortest path

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

For Finding Multiplicative Negative Cycles

Application of the Bellman Ford (shortest-path) Algorithm to detect real time arbitrage opportunities in currency trading.

Implementation of classical algorithms on graphs

Created my own topology to set up static routing. Also implemented an "application" layer routing protocol which implements distance vector routing using Bellman-Ford algorithm.

Algorithm to resolve the resource allocation of the DECSI/UFOP

Course by University of California San Diego on Algorithms on Graphs

Python implementation of single-source and all-pairs shortest paths algorithms.

This repository contains three CS 3364 projects demonstrating skills in algorithm design and data structures. Projects cover search engine reliability with sorting, course sequencing with topological sorting (DFS), and shortest paths using Dijkstra’s and Bellman-Ford algorithms, highlighting efficiency and data management.