Register

algorithm

769 views
0 0 votes

What is the running time of the most efficient deterministic algorithm you know for finding the shortest path between two vertices in a directed graph, where the weights of all edges are equal?(ALGO NAME)

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · #algorithms #best #a...Next → · Self Doubt
← Previous in category · #algorithms #best #a...Next in category → · Topological sorting
Position:
Show:

Related questions

1 1 vote
1 1 answer
106
106 views
GO Classes asked Aug 29
106 views
GO Classes DPP | GATE CS, DA | Algorithms | Dijkstra's Algorithm
Consider Dijkstra's algorithm on a graph having $V$ vertices and $E$ edges.Suppose an indexed priority queue is not used.Instead, the tentative distances are stored only ...
0 0 votes
2 2 answers
924
924 views
Vishal_Huneria asked Dec 28, 2025
924 views
Dijkstra’s algorithm on directed graph with negative edges – expected output?
0 0 votes
1 1 answer
465
465 views
Neeraj_patel asked Nov 14, 2024
465 views
Dijkstra Algorithm
What is the Time Complexity of the Dijkstra when it is using Adjacency list + Array (sorted or unsorted ) ? If it is O( V^2 + E ) then ,According to the General form of A...
0 0 votes
1 answers 1 answer
892
892 views
Mrityudoot asked Mar 7, 2024
892 views
Sorting Algorithm
For flag based approach in Bubble sort we can check first by a flag if the list is sorted or not in O(n), and if it is sorted, then no need to sort and the operation ends...