Similar Topics

DSA

21k+ articles

Greedy

2k+ articles

Sorting

1.7k+ articles

Competitive Programming

1.5k+ articles

Algorithms

1.2k+ articles

Graph

840+ articles

Data Structures

800+ articles

DSA Quiz

300+ articles

Dijkstra

40+ articles

Graph Shortest Paths Quiz

10+ articles

Algorithms-Graph Shortest Paths Quiz

20+ posts

Popular articles

Recent articles

Why does Dijkstra's Algorithm fail on negative weights?

Last Updated: 08 September 2023

Dijkstra's Algorithm: It is a graph searching algorithm that uses a Greedy Approach to find the shortest path from the source node to all other remaining nodes. It solves ...read more

Algorithms-Graph Shortest Paths Quiz

Applications of Dijkstra's shortest path algorithm

Last Updated: 23 September 2022

Dijkstra’s algorithm is one of the most popular algorithms for solving many single-source shortest path problems having non-negative edge weight in the graphs i.e., it is ...read more

Algorithms-Graph Shortest Paths Quiz

Maximize shortest path between given vertices by adding a single edge

Last Updated: 10 February 2023

Given an undirected graph of N nodes and M vertices. You are also given a K edges as selected[]. The task to maximize the shortest path length between node 1 to node N by ...read more

Algorithms-Graph Shortest Paths Quiz

Similar Topics

DSA

21k+ articles

Greedy

2k+ articles

Sorting

1.7k+ articles

Competitive Programming

1.5k+ articles

Algorithms

1.2k+ articles

Graph

840+ articles

Data Structures

800+ articles

DSA Quiz

300+ articles

Dijkstra

40+ articles

Graph Shortest Paths Quiz

10+ articles

Shortest path in a complement graph

Last Updated: 02 November 2023

Given an undirected non-weighted graph G. For a given node start return the shortest path that is the number of edges from start to all the nodes in the complement graph o...read more

Competitive Programming

Data Structures

Algorithms-Graph Shortest Paths Quiz

Graph Shortest Paths Quiz

Building an undirected graph and finding shortest path using Dictionaries in Python

Last Updated: 15 December 2021

Prerequisites:BFS for a GraphDictionaries in PythonIn this article, we will be looking at how to build an undirected graph and then find the shortest path between two node...read more

Data Structures

Algorithms-Graph Shortest Paths Quiz

Python dictionary-programs

Shortest path in a directed graph by Dijkstra’s algorithm

Last Updated: 21 February 2023

Given a directed graph and a source vertex in the graph, the task is to find the shortest distance and path from source to target vertex in the given graph where edges are ...read more

Competitive Programming

Data Structures

Algorithms-Graph Shortest Paths Quiz

Johnson’s algorithm for All-pairs shortest paths | Implementation

Last Updated: 14 February 2023

Given a weighted Directed Graph where the weights may be negative, find the shortest path between every pair of vertices in the Graph using Johnson's Algorithm.The detaile...read more

Technical Scripter

Data Structures

Algorithms-Graph Shortest Paths Quiz

Graph Shortest Paths Quiz

Technical Scripter 2018

Number of paths from source to destination in a directed acyclic graph

Last Updated: 14 February 2023

Given a Directed Acyclic Graph with n vertices and m edges. The task is to find the number of different paths that exist from a source vertex to destination vertex.Example...read more

Dynamic Programming

Topological Sorting

Algorithms-Dynamic Programming

Algorithms-Graph Shortest Paths Quiz

Algorithms | Graph Shortest Paths | Question 14

Last Updated: 28 June 2021

Is the following statement valid?. Given a weighted graph where weights of all edges are unique (no two edge have same weights), there is always a unique shortest path fro ...read more

Algorithms-Graph Shortest Paths Quiz

Graph Shortest Paths Quiz

Algorithms | Graph Shortest Paths | Question 12

Last Updated: 28 June 2021

Is the following statement valid about shortest paths?Given a graph, suppose we have calculated shortest path from a source to all other vertices. If we modify the graph ...read more

Algorithms-Graph Shortest Paths Quiz

Graph Shortest Paths Quiz

Algorithms | Graph Shortest Paths | Question 11

Last Updated: 28 June 2021

Given a directed graph where weight of every edge is same, we can efficiently find shortest path from a given source to destination using?(A)Breadth First Traversal(B)Dijk ...read more

Algorithms-Graph Shortest Paths Quiz

Graph Shortest Paths Quiz

Algorithms | Graph Shortest Paths | Question 10

Last Updated: 28 June 2021

Which of the following algorithm can be used to efficiently calculate single source shortest paths in a Directed Acyclic Graph?(A) Dijkstra(B) Bellman-Ford(C) Topological ...read more

Algorithms-Graph Shortest Paths Quiz

Graph Shortest Paths Quiz

Algorithms | Graph Shortest Paths | Question 8

Last Updated: 28 June 2021

In a weighted graph, assume that the shortest path from a source 's' to a destination 't' is correctly calculated using a shortest path algorithm. Is the following statem ...read more

Algorithms-Graph Shortest Paths Quiz

Graph Shortest Paths Quiz

Algorithms | Graph Shortest Paths | Question 14

Last Updated: 19 November 2018

Suppose we run Dijkstra’s single source shortest-path algorithm on the following edge weighted directed graph with vertex P as the source. In what order do the nodes get i...read more

Algorithms-Graph Shortest Paths Quiz

Graph Shortest Paths Quiz

Algorithms | Graph Shortest Paths | Question 14

Last Updated: 09 July 2021

Consider the directed graph shown in the figure below. There are multiple shortest paths between vertices S and T. Which one will be reported by Dijkstra's shortest path a...read more

Algorithms-Graph Shortest Paths Quiz

Graph Shortest Paths Quiz