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

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… Read More »

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… Read More »

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… Read More »

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… Read More »

Prerequisites: BFS for a Graph Dictonaries in Python In this article, we will be looking at how to build an undirected graph and then find… Read More »

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… Read More »

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… Read More »

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… Read More »

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… Read More »

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… Read More »

Match the following Group A Group B a) Dijkstra’s single shortest path algo p) Dynamic Programming b) Bellmen Ford’s single shortest path algo q) Backtracking… Read More »

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… Read More »

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)… Read More »

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)… Read More »

Following statement is true or false? If we make following changes to Dijkstra, then it can be used to find the longest simple path, assume… Read More »

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.… Read More »