Graph Algorithms Vizualizer

Graph Algorithms Visualizer

Depth First Search Algorithm

Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores as far as possible along each branch before backtracking.

Breadth First Search Algorithm

The Breadth First Search (BFS) algorithm is used to search a graph data structure for a node that meets a set of criteria. It starts at the root of the graph and visits all nodes at the current depth level before moving on to the nodes at the next depth level.

Topological Sort

A Topological Sort of a directed graph is a linear ordering of its vertices such that for every directed edge 'uv' from vertex 'u' to vertex 'v', 'u' comes before 'v' in the ordering.

Strongly Connected Components

A Strongly Connected Component is the portion of a directed graph in which there is a path from each vertex to another vertex.

Kruskal's Algorithm

Kruskal’s algorithm finds a safe edge to add to the growing forest by finding, of all the edges that connect any two trees in the forest, an edge (u,v) of least weight.

Prim's Algorithm

Prim's algorithm is similar to Kruskal's but it starts to build the Minimum Spanning Tree from any vertex in the graph.

Bellman-Ford Algorithm

The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph.

DAG Shortest Path Algorithm

A linear-time algorithm for computing shortest paths from a single source in a directed acyclic graph.

Dijkstra's Algorithm

Dijkstra’s algorithm is a single-source shortest-paths algorithm on a weighted, directed graph for the case in which all edge weights are nonnegative.

Ford Fulkerson Algorithm

The Ford Fulkerson algorithm works by iteratively finding an augmenting path, which is a path from the source to the sink in the residual graph, i.e., the graph obtained by subtracting the current flow from the capacity of each edge.

Edmon Karp's Algorithm

The Edmon Karp's algorithm is identical to the Ford–Fulkerson algorithm, except that the search order when finding the augmenting path is defined. The path found must be a shortest path that has available capacity which can be found by a breadth-first search.