The Algorithms logo
The Algorithms


Data Structures

Connected Components

Minimum Spanning Tree Prims 2

Kahns Algorithm Long

Graphs Floyd Warshall

Gale Shapley Bigraph

Breadth First Search

Bellman Ford

Dijkstra Algorithm


Multi Heuristic Astar

Breadth First Search 2

Minimum Spanning Tree Kruskal 2

Kahns Algorithm Topo

Greedy Min Vertex Cover

Graph List

Strongly Connected Components

Markov Chain

Minimum Path Sum

Minimum Spanning Tree Boruvka

G Topological Sort

Graph Matrix

Eulerian Path and Circuit for Undirected Graph

Tarjans Scc

Bidirectional a Star

Random Graph Generator

Scc Kosaraju

Even Tree

Check Bipartite Graph Bfs

Minimum Spanning Tree Prims

Bfs Shortest Path

Edmonds Karp Multiple Source and Sink

Directed and Undirected (Weighted) Graph

Greedy Best First

Bidirectional Breadth First Search

Bfs Zero One Shortest Path

Depth First Search

Check Cycle

Matching Min Vertex Cover

Basic Graphs

Articulation Points

Finding Bridges

Dijkstra 2

Check Bipartite Graph Dfs

Page Rank


Breadth First Search Shortest Path

Minimum Spanning Tree Kruskal

Frequent Pattern Graph Miner

Depth First Search 2

Dijkstra Smallest Path

Number Of Islands

Breadth First Shortest Path


Depth First Search Recursive

Prim MST

Node Neighbors

Kruskal MST

Depth First Search Iterative

Bridge Finding with Tarjan Algorithm


Max Flow with Ford Fulkerson and Edmond Karp Algo


Hamiltons Cycle

Cycle Check Directed Graph

Is Graph Bipartite

Bidirectional Dijkstra

Connected Components with Dsu

Depth First Search with Stack

Travelling Salesman Problem

Is Graph Bipartite 2

Hopcroft Karp

Topological Sort by Kahns Algo

Directed Graph



Centroid Decomposition

Disjoint Set Union

Prufer Code

Dinic Maxflow

Minimum Spanning Tree

Depth First Search Tic Tac Toe

Graph Enumeration

Two Satisfiability

Nearest Neighbour Algorithm