Graphs

Practice problems for Graphs to help you understand the concepts better.

Prim's algorithm is a greedy algorithm that finds the Minimum Spanning Tree (MST)

Tarjan's algorithm is an efficient method for finding strongly connected components in a directed graph.

1. Easy Level

Adjacency list is used to represent a graph using array and linked list

An adjacency matrix is a 2D array used to represent a graph, where each cell (i, j) is set to 1 if there's an edge from node i to node j, and 0 otherwise.

The Disjoint Set Union (DSU) algorithm efficiently manages dynamic connectivity and union-find operations.

In this blog post, we'll explore Johnson's Algorithm, a method to find the shortest paths between all pairs of nodes in a graph, even with negative weights.

Calculating the longest path from a given source in a Directed Acyclic Graph (DAG) with weighted edges.

In this blog post, we'll explore the PageRank algorithm, a method used to rank web pages based on their link structure.

In this post, we'll explore the Ant Colony Optimization (ACO) algorithm, applied to solving the Travelling Salesman Problem (TSP) using a probabilistic and pheromone-based approach.

In this blog post, we'll explore Breadth-First Search (BFS), a graph traversal algorithm used to explore vertices and edges level by level in a graph.

A bipartite graph is a graph whose vertices can be divided into two disjoint sets such that no two vertices within the same set are adjacent.

In this blog post, we'll explore Depth-First Search (DFS), a graph traversal algorithm used to explore vertices and edges by going as deep as possible before backtracking.

In this blog post, we'll explore Depth-First Search (DFS) using Java, a graph traversal algorithm used to explore vertices and edges by going as deep as possible before backtracking.

In this blog post, we'll explore Dijkstra's Algorithm, an efficient method to find the shortest path from a source to all other nodes in a graph.

This post explores Eulerian graphs, their properties, and algorithms for detecting and constructing Eulerian paths and circuits.

In this blog post, we'll explore the Flood Fill Algorithm, a popular technique used in computer graphics for determining connected regions, such as filling areas in images and solving puzzles like the paint bucket tool in graphics editing software.

In this blog post, we'll explore the Floyd's-Algorithm, an efficient method to implement all pair shortest paths

The program is to return a deep copy of the graph, preserving the structure and values of its nodes.

In this document, we explore the graph coloring problem and provide a C implementation using a greedy algorithm.

Reverse a directed graph so that the incoming edges will be converted to outgoing edges betwwen the same nodes.

In this blog post, we'll explore the Hopcroft-Karp algorithm, an efficient method for finding the maximum matching in a bipartite graph.

In this blog post, we will delve into Kahn's Algorithm, an efficient method for topological sorting of a directed acyclic graph (DAG). This algorithm provides a way to find a linear ordering of vertices such that for every directed edge u → v, vertex u comes before vertex v.

In this blog post, we'll explore Kosaraju's Algorithm, an efficient algorithm used to find all Strongly Connected Components (SCCs) in a directed graph.

In this blog post, we'll explore Kruskal's Algorithm, a greedy algorithm used to find the Minimum Spanning Tree in a graph.

In this blog post, we'll explore Minimum Spanning Tree (MST) algorithms, specifically Prim's and Kruskal's algorithms, which are used to find the minimum cost spanning tree in a weighted graph.

In this blog post, we'll explore the Warshall's-Algorithm, an efficient method to Compute the transitive closure of a given directed graph