The Algorithms logo
The Algorithms


Data Structures

Scc Kosaraju

Gale Shapley Bigraph

Greedy Min Vertex Cover

Breadth First Search Shortest Path

Connected Components

Kahns Algorithm Long

Minimum Spanning Tree Kruskal

G Topological Sort

Minimum Spanning Tree Prims 2

Strongly Connected Components

Dijkstra Alternate

Breadth First Search Shortest Path 2

Markov Chain

Breadth First Search 2

Minimum Spanning Tree Boruvka

Graph Matrix

Frequent Pattern Graph Miner

Dijkstra 2

Minimum Spanning Tree Prims

Directed and Undirected (Weighted) Graph

Basic Graphs

Graphs Floyd Warshall

Edmonds Karp Multiple Source and Sink

Depth First Search 2

Breadth First Search Zero One Shortest Path

Eulerian Path and Circuit for Undirected Graph

Matching Min Vertex Cover

Bidirectional a Star

Kahns Algorithm Topo

Dijkstra Algorithm

Minimum Spanning Tree Kruskal 2


Depth First Search


Check Bipartite Graph Dfs

Graph List

Breadth First Search

Multi Heuristic Astar

Finding Bridges

Greedy Best First

Page Rank

Tarjans Scc

Minimum Path Sum

Even Tree

Random Graph Generator

Check Cycle

Articulation Points

Bellman Ford

Bidirectional Breadth First Search

Bi Directional Dijkstra

Check Bipartite Graph Bfs

Number Of Islands

Prim MST

Breadth First Shortest Path

Depth First Search Iterative

Kruskal MST

LCA Binary Lifting

Depth First Search Recursive


Dijkstra Smallest Path

Node Neighbors


Binary Lifting

Bridge Finding with Tarjan Algorithm

Is Graph Bipartite 2

Hamiltons Cycle

Hopcroft Karp

Topological Sort by Kahns Algo

Depth First Search with Stack


Max Flow with Ford Fulkerson and Edmond Karp Algo

Travelling Salesman Problem

Is Graph Bipartite

Connected Components with Dsu

Cycle Check Directed Graph

Directed Graph



Dinic Maxflow

Centroid Decomposition

Disjoint Set Union

Two Satisfiability

Depth First Search Tic Tac Toe

Graph Enumeration

Minimum Spanning Tree

Prufer Code

Bipartite Matching

Nearest Neighbour Algorithm