Courses
Tutorials
Practice

Algorithms-Graph Shortest Paths Quiz

24 posts

Why does Dijkstra's Algorithm fail on negative weights?

Last Updated: 23 July 2024

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

Dijkstra

Graph

Analysis of Algorithms

Greedy

Shortest Path

Algorithms-Graph Shortest Paths Quiz

DSA

Create a Graph by connecting divisors from N to M and find shortest path

Last Updated: 18 May 2021

Given two natural numbers N and M, Create a graph using these two natural numbers using relation that a number is connected to its largest factor other than itself. The ta...read more

Algorithms-Graph Shortest Paths Quiz

Numbers

divisors

DSA

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

Dijkstra

Graph

Algorithms

Algorithms-Graph Shortest Paths Quiz

Picked

DSA

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

DSA

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

Articles

Graph

Algorithms

Competitive Programming

Data Structures

Placements

Algorithms-Graph Shortest Paths Quiz

Graph Shortest Paths Quiz

DSA

Finding shortest path between any two nodes using Floyd Warshall Algorithm

Last Updated: 13 October 2023

Given a graph and two nodes u and v, the task is to print the shortest path between u and v using the Floyd Warshall algorithm.Examples:Input: u = 1, v = 3Output: 1 - 2 - ...read more

Graph

Algorithms

Dynamic Programming

Advanced Data Structure

Algorithms-Graph Shortest Paths Quiz

Graph Shortest Paths Quiz

C++ Programs

DSA

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

Algorithms-Graph Shortest Paths Quiz

python-dict

Python dictionary-programs

DSA

Shortest path in a directed graph by Dijkstra’s algorithm

Last Updated: 27 December 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

C++

Data Structures

Algorithms-Graph Shortest Paths Quiz

C++ Programs

DSA

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

Last Updated: 28 April 2024

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 detail...read more

Graph

Technical Scripter

Data Structures

Algorithms-Graph Shortest Paths Quiz

Graph Shortest Paths Quiz

Picked

Technical Scripter 2018

DSA

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

Last Updated: 05 December 2024

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. Exampl...read more

Dynamic Programming

Sorting

Topological Sorting

Algorithms-Dynamic Programming

Algorithms-Graph Shortest Paths Quiz

DSA

Algorithms | Graph Shortest Paths | Question 15

Last Updated: 28 June 2021

Is the following statement valid?. Given a graph where all edges have positive weights, the shortest paths produced by Dijsktra and Bellman Ford algorithm may be different...read more

DSA Quiz

Algorithms-Graph Shortest Paths Quiz

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

DSA Quiz

Algorithms-Graph Shortest Paths Quiz

Graph Shortest Paths Quiz

Algorithms | Graph Shortest Paths | Question 13

Last Updated: 28 June 2021

Match the following Group A Group Ba) Dijkstra's single shortest path algo p) Dynamic Programming...read more

DSA Quiz

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

DSA Quiz

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

DSA Quiz

Algorithms-Graph Shortest Paths Quiz

Graph Shortest Paths Quiz

1 2