The Algorithms logo
The Algorithms


Data Structures

Articulation Points

Graph Matrix

Depth First Search

Frequent Pattern Graph Miner

Breadth First Search

Minimum Spanning Tree Prims

Even Tree

Check Bipartite Graph Bfs

Minimum Spanning Tree Kruskal

Matching Min Vertex Cover

Random Graph Generator


Breadth First Search Shortest Path

Bellman Ford

Check Cycle

Greedy Min Vertex Cover

Markov Chain

Greedy Best First

G Topological Sort

Check Bipartite Graph Dfs

Kahns Algorithm Long

Tarjans Scc

Bidirectional Breadth First Search

Graph List

Page Rank

Dijkstra Algorithm

Kahns Algorithm Topo

Minimum Spanning Tree Prims 2

Bfs Zero One Shortest Path


Breadth First Search 2

Finding Bridges

Minimum Spanning Tree Kruskal 2

Strongly Connected Components

Minimum Spanning Tree Boruvka

Connected Components

Gale Shapley Bigraph

Graphs Floyd Warshall

Scc Kosaraju

Dijkstra 2

Bidirectional a Star

Multi Heuristic Astar

Basic Graphs

Eulerian Path and Circuit for Undirected Graph

Depth First Search 2

Bfs Shortest Path

Directed and Undirected (Weighted) Graph

Edmonds Karp Multiple Source and Sink

Breadth First Shortest Path

Prim MST

Node Neighbors

Depth First Search Recursive


Depth First Search Iterative

Kruskal MST

Number Of Islands

Dijkstra Smallest Path

Hopcroft Karp

Max Flow with Ford Fulkerson and Edmond Karp Algo

Cycle Check Directed Graph

Bridge Finding with Tarjan Algorithm

Depth First Search with Stack

Bidirectional Dijkstra


Connected Components with Dsu

Travelling Salesman Problem

Topological Sort by Kahns Algo

Is Graph Bipartite

Is Graph Bipartite 2


Hamiltons Cycle

Directed Graph



Minimum Spanning Tree

Centroid Decomposition

Prufer Code

Depth First Search Tic Tac Toe

Graph Enumeration

Disjoint Set Union

Dinic Maxflow

Nearest Neighbour Algorithm