The Algorithms logo
The Algorithms


Data Structures

Depth First Search

Breadth First Search Shortest Path

Markov Chain

Basic Graphs

Breadth First Search

Dijkstra 2

Edmonds Karp Multiple Source and Sink

Frequent Pattern Graph Miner

Kahns Algorithm Topo

Minimum Spanning Tree Kruskal

Graph List


Directed and Undirected (Weighted) Graph

Greedy Min Vertex Cover

Graphs Floyd Warshall

Bidirectional Breadth First Search

Check Cycle

Scc Kosaraju

Bidirectional a Star

Bellman Ford

Minimum Path Sum

Even Tree

Finding Bridges

Dijkstra Alternate


Check Bipartite Graph Dfs

Minimum Spanning Tree Prims

Strongly Connected Components

G Topological Sort

Page Rank

Breadth First Search Zero One Shortest Path

Check Bipartite Graph Bfs

Minimum Spanning Tree Boruvka

Graph Matrix

Articulation Points

Kahns Algorithm Long

Bi Directional Dijkstra

Multi Heuristic Astar

Connected Components

Tarjans Scc

Matching Min Vertex Cover

Dijkstra Algorithm

Breadth First Search 2

Breadth First Search Shortest Path 2

Minimum Spanning Tree Prims 2

Greedy Best First

Eulerian Path and Circuit for Undirected Graph

Minimum Spanning Tree Kruskal 2

Depth First Search 2

Gale Shapley Bigraph

Random Graph Generator

Depth First Search Iterative

Number Of Islands

LCA Binary Lifting

Depth First Search Recursive

Dijkstra Smallest Path

Binary Lifting

Node Neighbors


Kruskal MST

Breadth First Shortest Path

Prim MST


Cycle Check Directed Graph

Bridge Finding with Tarjan Algorithm

Hopcroft Karp

Topological Sort by Kahns Algo

Is Graph Bipartite

Hamiltons Cycle

Max Flow with Ford Fulkerson and Edmond Karp Algo

Depth First Search with Stack

Travelling Salesman Problem

Is Graph Bipartite 2


Connected Components with Dsu

Directed Graph



Depth First Search Tic Tac Toe

Graph Enumeration

Disjoint Set Union

Centroid Decomposition

Minimum Spanning Tree

Dinic Maxflow

Two Satisfiability

Bipartite Matching

Prufer Code

Area of Island

Nearest Neighbour Algorithm