Shortest Path

Shortest path algorithms help us to find the shortest possible path between two vertices/nodes in a graph. There are two types of shortest path problems, namely - Single Source Shortest Path and All Pairs Shortest Path. There are also several shortest path algorithms such as,
1. Dijkstra's Algorithm (Single Source Shortest Path)
2. Bellman Ford's Algorithm (Single Source Shortest Path)
3. Floyd Warshall's Algorithm (All Pairs Shortest Path)

Dijkstra's Algorithm

By Aditya Narayan Joardar

● Published At Dec 2021

In this article, we will discuss Dijkstra’s Algorithm with various examples and explanations.... Keep reading ..

Find Maximum Shortest Distance in Each Component of a Graph

By Nishant Rana

● Published At Feb 2022

This blog will cover the question to find the maximum shortest distance in each component of a Graph.
... Keep reading ..

Johnson’s Algorithm for All-Pairs Shortest Paths

By Abhishek Ranjan

● Published At Jan 2022

In this article, we will discuss Jhonson's Algorithm for the all-pairs shortest path and try to understand its time complexity.... Keep reading ..

Why does Dijkstra’s algorithm fail on negative weights?

By Shreya Deep

● Published At Dec 2021

In this article, we will find out why Dijkstra's algorithm fails on negative edge weights.... Keep reading ..

Difference between the shortest and second shortest path in an Unweighted Bidirectional Graph

By Abhishek Ranjan

● Published At Dec 2021

In this article, we will try to solve a graph theory problem Difference between the shortest and second shortest path in an Unweighted Bidirectional Graph that can be asked in the interviews.
... Keep reading ..

Shortest path in a directed acyclic graph

By aniket verma

● Published At Oct 2021

This article will brief you on finding the shortest path in a directed acyclic graph.... Keep reading ..

Shortest path in an unweighted graph

By aniket verma

● Published At Oct 2021

This article will brief you on finding the Shortest path in an unweighted graph.... Keep reading ..

Number of distinct Shortest Paths from Node 1 to N in a Weighted and Directed Graph

By Abhishek Ranjan

● Published At Dec 2021

n this article, we will try to solve a graph theory problem that can be asked in the interviews.... Keep reading ..

Maximize the shortest path between given vertices by adding a single edge

By Apoorv

● Published At Feb 2022

This article will discuss the solution of the problem “Maximize the shortest path between given vertices by adding a single edge”
... Keep reading ..

Minimum Cost using Dijkstra by reducing the cost of an Edge

By Ishita Chawla

● Published At Dec 2021

This blog will discuss the problem of minimum cost using Dijkstra by reducing the cost of an edge.... Keep reading ..

Minimum possible modifications in the matrix to reach the destination

By GAZAL ARORA

● Published At Dec 2021

In this article, we are going to learn how to convert a matrix problem into a graph problem and solve it using graph algorithms.... Keep reading ..