The Algorithms logo
The Algorithms


Data Structures

Directed and Undirected (Weighted) Graph

Minimum Spanning Tree Prims 2

Tarjans Scc

Bidirectional Breadth First Search

Bellman Ford


Check Cycle

Kahns Algorithm Topo

Eulerian Path and Circuit for Undirected Graph

Dijkstra Algorithm

G Topological Sort

Bidirectional a Star

Gale Shapley Bigraph

Graphs Floyd Warshall

Minimum Spanning Tree Boruvka

Basic Graphs

Page Rank

Articulation Points

Greedy Min Vertex Cover

Connected Components

Minimum Spanning Tree Kruskal 2

Edmonds Karp Multiple Source and Sink


Frequent Pattern Graph Miner

Depth First Search 2

Finding Bridges

Markov Chain

Minimum Spanning Tree Prims

Dijkstra 2

Scc Kosaraju

Check Bipartite Graph Dfs

Minimum Spanning Tree Kruskal

Depth First Search

Random Graph Generator

Check Bipartite Graph Bfs

Breadth First Search

Graph List

Multi Heuristic Astar

Breadth First Search 2

Graph Matrix

Even Tree

Strongly Connected Components

Kahns Algorithm Long

Greedy Best First

Matching Min Vertex Cover

Dijkstra Smallest Path

Node Neighbors

Depth First Search Recursive

Kruskal MST

Prim MST

Depth First Search Iterative

Number Of Islands



Topological Sort by Kahns Algo

Max Flow with Ford Fulkerson and Edmond Karp Algo

Bridge Finding with Tarjan Algorithm

Depth First Search with Stack

Is Graph Bipartite

Hamiltons Cycle


Cycle Check Directed Graph

Bidirectional Dijkstra

Connected Components with Dsu

Hopcroft Karp

Is Graph Bipartite 2

Travelling Salesman Problem

Directed Graph



Minimum Spanning Tree

Depth First Search Tic Tac Toe

Nearest Neighbour Algorithm