Similar Topics

Web Technologies32.1K+ articles

DSA20.4K+ articles

Greedy1.4K+ articles

Graph565+ articles

DFS360+ articles

BFS228+ articles

priority-queue148+ articles

Greedy Algorithms112+ articles

Shortest Path71+ articles

Floyd-Warshall7+ articles

Dijkstra

52 posts

Minimum Time Required to Visit Each Disappearing Nodes

Last Updated: 23 July 2025

Given an undirected graph with n nodes that are represented by a 2D array edges where edges[i] = [ui, vi, timei] describes an edge between nodes ui and vi with a traversal...read more

Interview-Questions

Is Dijkstra a greedy algorithm?

Last Updated: 23 July 2025

In the world of computer science and algorithms, there's a lot of talk about Dijkstra's algorithm and its classification as a "greedy" algorithm. In this article, we will ...read more

Greedy Algorithms

Data Structures and Algorithms-QnA

Modify shortest distance between source and destination to K

Last Updated: 23 July 2025

Given an undirected weighted connected graph with N nodes and M edges. The weight of the edges given can be a positive integer or -1. Your task is to replace -1 weights wi...read more

article_image

Geeks Premier League

TCS-coding-questions

Geeks Premier League 2023

Minimizing Infection Time in a Directed Graph

Last Updated: 23 July 2025

Given a directed graph of N nodes [1, N] represented by a 2D array graph[][], and an integer K which is the initially infected node. The graph[i] = (ui, vi, wi) represents...read more

Geeks Premier League

Geeks Premier League 2023

Implement a parallel programming task using graphs

Last Updated: 23 July 2025

Given a weighted directed graph with N nodes and M edges along with a source node S, use Parallel Programming to find the shortest distance from the source node S to all o...read more

Geeks Premier League

Geeks Premier League 2023

Comparison between Shortest Path Algorithms:

Last Updated: 23 July 2025

Finding the shortest way is becoming more important in a world where time and distance matter. There are multiple shorted path algorithms exists. Therefore, in this articl...read more

Shortest Path Algorithm Tutorial with Problems

Last Updated: 23 July 2025

In this article, we are going to cover all the commonly used shortest path algorithm while studying Data Structures and Algorithm. These algorithms have various pros and c...read more

article_image

Topological Sorting

Minimum cost to convert a '1' to a given number

Last Updated: 23 July 2025

Given a positive integer 'n'. Starting with 1 find the minimum cost required to convert it to n using the following operations : Multiply the number by 2 with costs aAdd 1...read more

Data Structures-Graph

Greedy Algorithms

Ascending insertion of elements in graph

Last Updated: 23 July 2025

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 entrance vertex. N elements are num...read more

Greedy Algorithms

Graph Traversals

Number of Ways to Reach Destination in Shortest Time

Last Updated: 18 November 2025

Given an undirected weighted graph containing V vertices from 0 to V-1 represented as an adjacency list adj[][], where each adj[u] contains pairs [v, t] indicating there i...read more

article_image

Dijkstra's Algorithm based Common Questions

Last Updated: 22 December 2025

Dijkstra’s Algorithm is one of the most popular algorithms in graph theory, used to find the shortest path from a single source to all other vertices in a graph with non-n...read more

article_image

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 node 1 and ending at node n. N...read more

article_image

Count ways to reach destination of given Graph in minimum time

Last Updated: 23 July 2025

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 parallel edges. Also, an integer arr...read more

Technical Scripter

Technical Scripter 2022

Last Updated: 23 July 2025

Geek is in a maze of size N * M. Each cell in the maze is made of either '.' or '#'. An empty cell is represented by '.' and an obstacle is represented by '#'. The task is...read more

Find Maximum Shortest Distance in Each Component of a Graph

Last Updated: 23 July 2025

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

article_image

1 2 3 4