## Maximum Bipartite Matching Problem – Java

Problem: Given a bipartite graph, write an algorithm to find the maximum matching. The maximum bipartite matching solves many problems … Read more

Problem: Given a bipartite graph, write an algorithm to find the maximum matching. The maximum bipartite matching solves many problems … Read more

Objective: Given a graph represented by the adjacency List, write a Breadth-First Search(BFS) algorithm to check whether the graph is … Read more

Objective: Given a graph, write an algorithm to find all the articulation points or cut vertices. Articulation Points: In a … Read more

Objective: Given an undirected graph, Write an algorithm to determine whether its tree or not. An undirected graph is a … Read more

Objective: Given a 2d grid map of ‘1’s (land) and ‘0’s (water), count the number of distinct or unique islands. … Read more

Objective: Given a graph and a source vertex write an algorithm to find the shortest path from the source vertex to … Read more

Objective: Given a 2d grid map of ‘1’s (land) and ‘0’s (water), count the number of islands. An island is … Read more

Objective: Given an undirected graph, write an algorithm to find out whether the graph is connected or not. Graph Connectivity: … Read more

Objective: Given a graph represented by the adjacency List, write a Depth-First Search(DFS) algorithm to check whether the graph is … Read more

Objective: Given a graph represented by an adjacency list and a vertex, write a program to remove the given vertex … Read more

Given- Given V vertices, what is the maximum number of edges can be added to make Acyclic Undirected Graph. Follow … Read more

Objective: Given a disconnected graph, Write a program to do the BFS, Breadth-First Search or traversal. Example: Approach: Earlier we … Read more

Objective: Given a graph represented by the adjacency matrix, write a Depth-First Search(DFS) algorithm to check whether the graph is … Read more

Bipartite Graphs OR Bigraphs is a graph whose vertices can be divided into two independent groups or sets, U and … Read more