The Algorithms logo
The Algorithms


Data Structures

Depth First Search

Scc Kosaraju

Dijkstra Algorithm

Markov Chain

Minimum Spanning Tree Boruvka

Greedy Min Vertex Cover

Dijkstra Alternate

Frequent Pattern Graph Miner

Kahns Algorithm Topo

Minimum Spanning Tree Prims

Breadth First Search Shortest Path 2

Minimum Spanning Tree Kruskal

Random Graph Generator

Greedy Best First

Check Bipartite Graph Dfs

Graph Matrix

Graphs Floyd Warshall

Minimum Spanning Tree Prims 2

Finding Bridges

Breadth First Search

Eulerian Path and Circuit for Undirected Graph

Multi Heuristic Astar

Bellman Ford

Page Rank

Breadth First Search Shortest Path

Gale Shapley Bigraph

Directed and Undirected (Weighted) Graph

Bidirectional a Star

G Topological Sort


Basic Graphs


Edmonds Karp Multiple Source and Sink

Strongly Connected Components

Bidirectional Breadth First Search

Dijkstra 2

Depth First Search 2

Connected Components

Minimum Spanning Tree Kruskal 2

Tarjans Scc

Articulation Points

Even Tree

Minimum Path Sum

Breadth First Search 2

Check Cycle

Kahns Algorithm Long

Check Bipartite Graph Bfs

Matching Min Vertex Cover

Breadth First Search Zero One Shortest Path

Graph List

Binary Lifting

Prim MST

LCA Binary Lifting

Depth First Search Recursive

Depth First Search Iterative

Number Of Islands


Kruskal MST

Dijkstra Smallest Path

Node Neighbors

Breadth First Shortest Path


Bidirectional Dijkstra

Hopcroft Karp

Topological Sort by Kahns Algo

Travelling Salesman Problem

Depth First Search with Stack


Is Graph Bipartite

Connected Components with Dsu

Bridge Finding with Tarjan Algorithm

Cycle Check Directed Graph

Is Graph Bipartite 2

Max Flow with Ford Fulkerson and Edmond Karp Algo

Hamiltons Cycle

Directed Graph



Graph Enumeration

Depth First Search Tic Tac Toe

Two Satisfiability

Dinic Maxflow

Centroid Decomposition

Disjoint Set Union

Minimum Spanning Tree

Prufer Code

Bipartite Matching

Nearest Neighbour Algorithm