The Gateway to Computer Science Excellence
0 votes
32 views
for directed weighted graph with edge weight non negative whether dijakstra will give correct result in every case ???
in Algorithms by (109 points) | 32 views
0
Yes, Dijkstra will correctly give single source shortest path distances
0
m talking about every case....
0

@ishitasinha Yeah, me too

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,741 questions
57,240 answers
198,008 comments
104,600 users