Dijkstra

BFS

DFS

bellman-ford

Ascending insertion of elements in graph

Floyd-Warshall

Last Updated: 19 September 2023

Given a graph consisting of vertices numbered from 1 to N and having M bidirectional edges connecting vertices u and v. Let P denote an entr ...read more

Find the maximum product of edge weights in Graph

Last Updated: 10 July 2023

Given a directed, weighted graph with n nodes and e edges, the task is to find the maximum product of edge weights in any path starting from...read more

Number of ways to reach at destination in shortest time

Similar Topics

DSA

21.8k+ articles

Competitive Programming

2.2k+ articles

Greedy

2k+ articles

Algorithms

1.9k+ articles

Data Structures

1.1k+ articles

Graph

900+ articles

BFS

210+ articles

priority-queue

130+ articles

Greedy Algorithms

100+ articles

Shortest Path

69+ articles

Last Updated: 18 April 2023

Given an integer n and a 2D integer array of edges where edges[i] = [ui, vi, timei] means that there is an edge between intersections ui and ...read more

Count ways to reach destination of given Graph in minimum time

Last Updated: 14 March 2023

Given an undirected graph with N nodes (numbered from 0 to N-1) such that any node can be reached from any other node and there are no paral ...read more

Technical Scripter 2022

Minimum cost of path between given nodes containing at most K nodes in a directed and weighted graph

Last Updated: 20 February 2023

Given a directed weighted graph represented by a 2-D array graph[][] of size n and 3 integers src, dst, and k representing the source point,...read more

Find Maximum Shortest Distance in Each Component of a Graph

Last Updated: 21 March 2023

Given an adjacency matrix graph[][] of a weighted graph consisting of N nodes and positive weights, the task for each connected component of...read more

Rabbit House | Google Kickstart 2021 Round A

Last Updated: 02 February 2024

Barbara got really good grades in school last year, so her parents decided to gift her with a pet rabbit. She was so excited that she built ...read more

teachmedijkstra library in Python

Last Updated: 06 June 2021

Dijkstra’s algorithm is very similar to Prim’s algorithm for minimum spanning trees. Like Prim’s MST, we generate a SPT (shortest path...read more

Minimum possible modifications in the matrix to reach destination

Python

python-modules

Last Updated: 09 March 2023

Given a matrix of size N x M consisting of integers 1, 2, 3 and 4.Each value represents the possible movement from that cell:1 - move left2 ...read more

Competitive Programming

BFS

Data Structures

Path with minimum XOR sum of edges in a directed graph

Last Updated: 22 September 2021

Given a directed graph with N nodes and E edges, a source S and a destination D nodes. The task is to find the path with the minimum XOR sum ...read more

Arrays

Path with smallest product of edges with weight >= 1

Competitive Programming

Last Updated: 10 February 2023

Given a directed graph with N nodes and E edges where the weight of each of the edge is 1, also given a source S and a destination D. The t ...read more

Find the minimum number of moves to reach end of the array

Last Updated: 17 January 2022

Given an array arr[] of size N where every element is from the range [0, 9]. The task is to reach the last index of the array starting from ...read more

Minimum Possible sum of digits in a positive multiple of N

Last Updated: 08 May 2023

Given a number N, find the minimum possible sum of digits that can be obtained from a positive Multiple of N. Constraints : 1=N=10^5. Exampl ...read more

Sum of shortest distance on source to destination and back having at least a common vertex

Analysis of Algorithms

Last Updated: 14 March 2023

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