Dijkstra Archives - GeeksforGeeks

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

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

Dijkstra

Shortest Path

Graph

Mathematical

Find Maximum Shortest Distance in Each Component of a Graph

Expert

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

DFS

Dijkstra

Dynamic Programming

Graph

Rabbit House | Google Kickstart 2021 Round A

Expert

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

Dijkstra

Google

priority-queue

Matrix

Searching

Tree

Why does Dijkstra’s Algorithm fail on negative weights?

Medium

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

Algorithms-Graph Shortest Paths Quiz

Dijkstra

Shortest Path

Analysis

Graph

Greedy

Number of distinct Shortest Paths from Node 1 to N in a Weighted and Directed Graph

Medium

Given a directed and weighted graph of N nodes and M edges, the task is to count the number of shortest length paths between node… Read More

BFS

Dijkstra

Shortest Path

Graph

teachmedijkstra library in Python

Dijkstra’s algorithm is very similar to Prim’s algorithm for minimum spanning trees. Like Prim’s MST, we generate a SPT (shortest path tree) with a given… Read More

Dijkstra

python-modules

Python

Applications of Dijkstra’s shortest path algorithm

Expert

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

Algorithms-Graph Shortest Paths Quiz

Dijkstra

Picked

Algorithms

Graph

Single source shortest path between two cities

Medium

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

bellman-ford

BFS

DFS

Dijkstra

Shortest Path

Algorithms

Data Structures

Dynamic Programming

Graph

Minimum Cost using Dijkstra by reducing cost of an Edge

Hard

Given an undirected graph of N nodes and M edges of the form {X, Y, Z} such that there is an edge between X and… Read More

Algorithms-Graph Traversals

cpp-priority-queue

Data Structures-Graph

Dijkstra

priority-queue

Algorithms

Graph

Queue

Shortest path in a directed graph by Dijkstra’s algorithm

Hard

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

Algorithms-Graph Shortest Paths Quiz

Dijkstra

Algorithms

Competitive Programming

Data Structures

Graph

Greedy

Sorting

Tree

Minimum possible modifications in the matrix to reach destination

Hard

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

BFS

Dijkstra

Algorithms

Competitive Programming

Data Structures

Graph

Queue

Path with minimum XOR sum of edges in a directed graph

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

Bitwise-XOR

Dijkstra

priority-queue

Arrays

Competitive Programming

Graph

Write From Home

Path with smallest product of edges with weight >= 1

Medium

Given a directed graph with N nodes and E edges where the weight of each of the edge is > 1, also given a source… Read More

Dijkstra

Algorithms

Data Structures

Graph

Greedy

Heap

What are the differences between Bellman Ford’s and Dijkstra’s algorithms?

Medium

Bellman Ford’s algorithm Like other Dynamic Programming Problems, the algorithm calculates shortest paths in a bottom-up manner. It first calculates the shortest distances which have at-most… Read More

Dijkstra

Algorithms

Difference Between

Widest Path Problem | Practical application of Dijkstra’s Algorithm

Hard

It is highly recommended to read Dijkstra’s algorithm using the Priority Queue first.Widest Path Problem is a problem of finding a path between two vertices… Read More

Dijkstra

Algorithms

Data Structures

Graph

Tag Archives: Dijkstra

Start Your Coding Journey Now!