Alger logo
𝔸𝕝𝕘𝕖𝕣
About

Graphs

Data Structures
Graphs

Dijkstra 2

Markov Chain

Finding Bridges

Strongly Connected Components

Bidirectional a Star

Minimum Spanning Tree Kruskal

Bidirectional Breadth First Search

Breadth First Search 2

Minimum Spanning Tree Prims

Tarjans Scc

Depth First Search

Connected Components

Boruvka

Greedy Min Vertex Cover

Graph Matrix

Kahns Algorithm Topo

Dijkstra

Depth First Search 2

Matching Min Vertex Cover

Breadth First Search Shortest Path

Minimum Spanning Tree Prims 2

Graph List

Minimum Spanning Tree Boruvka

Bellman Ford

Edmonds Karp Multiple Source and Sink

Directed and Undirected (Weighted) Graph

Dijkstra Algorithm

Frequent Pattern Graph Miner

Multi Heuristic Astar

Gale Shapley Bigraph

Check Bipartite Graph Dfs

Bfs Zero One Shortest Path

Eulerian Path and Circuit for Undirected Graph

Basic Graphs

Kahns Algorithm Long

Minimum Spanning Tree Kruskal 2

Minimum Path Sum

Greedy Best First

Page Rank

Even Tree

Check Bipartite Graph Bfs

Breadth First Search

Random Graph Generator

Bfs Shortest Path

G Topological Sort

Scc Kosaraju

Check Cycle

Articulation Points

Graphs Floyd Warshall

Number Of Islands

Prim MST

Density

Node Neighbors

Dijkstra Smallest Path

Kruskal MST

Breadth First Shortest Path

Depth First Search Recursive

Depth First Search Iterative

Cycle Check Directed Graph

Is Graph Bipartite

Topological Sort by Kahns Algo

Depth First Search with Stack

Travelling Salesman Problem

Hamiltons Cycle

Bridge Finding with Tarjan Algorithm

Connected Components with Dsu

Kosaraju

Bidirectional Dijkstra

Kruskal

Is Graph Bipartite 2

Max Flow with Ford Fulkerson and Edmond Karp Algo

Hopcroft Karp

Directed Graph

Backtracking

Topological

Prufer Code

Minimum Spanning Tree

Graph Enumeration

Dinic Maxflow

Centroid Decomposition

Depth First Search Tic Tac Toe

Disjoint Set Union

Nearest Neighbour Algorithm

Algerlogo

© Alger 2022

About us

We are a group of programmers helping each other build new things, whether it be writing complex encryption programs, or simple ciphers. Our goal is to work together to document and model beautiful, helpful and interesting algorithms using code. We are an open-source community - anyone can contribute. We check each other's work, communicate and collaborate to solve problems. We strive to be welcoming, respectful, yet make sure that our code follows the latest programming guidelines.