# Tag Archives: Shortest Path

Given a weighted undirected graph T consisting of nodes valued [0, N – 1] and an array Edges[] of type {u, v, w} that denotes… Read More
Given two strings start and target(both of the same length) and a list of strings str[], the task is to print all possible smallest sequences… Read More
Given a source node S, a sink node T, two matrices Cap[ ][ ] and Cost[ ][ ] representing a graph, where Cap[i][j] is the… Read More
Given a graph of N Nodes and E edges in form of {U, V, W} such that there exists an edge between U and V… Read More
Given a weighted, directed graph G, an array V[] consisting of vertices, the task is to find the Minimum Cost Path passing through all the… Read More
Given a weighted directed graph consisting of V vertices and E edges. The task is to print the cyclic path whose sum of weight is… Read More
Given a matrix mat[][] and an integer X, the task is to find the minimum number of operations required to reach  from . In each move, we… Read More
Given a graph and a source vertex src in a weighted undirected graph, find the shortest paths from src to all vertices in the given… Read More
Given an unweighted directed graph and Q queries consisting of sequences of traversal between two nodes of the graph, the task is to find out… Read More
Given two number N and M. The task is to find the number of shortest paths to reach the cell(i, j) in the grid of… Read More
Given a directed weighted graph and the source and destination vertex. The task is to find the sum of shortest distance on the path going… Read More
We have introduced Bellman Ford and discussed on implementation here.Input: Graph and a source vertex src Output: Shortest distance to all vertices from src. If there… Read More
Given a Weighted Directed Graph and a destination vertex in the graph, find the shortest distance from all vertex to the destination vertex.Input :   1… Read More
Uniform-Cost Search is a variant of Dijikstra’s algorithm. Here, instead of inserting all vertices into a priority queue, we insert only source, then one by… Read More
Given an adjacency list representation of a directed graph, the task is to find the path from source to every other node in the graph… Read More