Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Consider the following strategy to convert an undirected graph with negative edge weights to one that does not have negative edge weights. Let the maximum magnitude negative edge weight in the graph be -k. Then, for each edge in the graph with weight w, update the weight to w+k+1. Consider the following claim: To solve the shortest path problem in the original graph, we can run Dijkstra's algorithm on the modified graph and subtract the added weights to get the original distances. Which of the following is not correct. The claim is not true in general. The claim is not true in general for graphs with cycles. The claim is true for connected acyclic graphs. The claim is true for all graphs.
sonalrawat
asked
in
Algorithms
Aug 21, 2023
recategorized
Aug 21, 2023
by
makhdoom ghaya
317
views
0
votes
0
votes
dijkstras-algorithm
shortest-path
sonalrawat
asked
in
Algorithms
Aug 21, 2023
recategorized
Aug 21, 2023
by
makhdoom ghaya
by
sonalrawat
317
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
0
answers
1
Malusi
asked
in
Graph Theory
Jan 12
85
views
Consider a weighted undirected graph with positive edge weights and let (u, v) be an [2] edge in the graph. It is known that the shortest path from source vertex r to u has weight 53 and shortest path from r to v has weight 65. Which statement is always true?
Malusi
asked
in
Graph Theory
Jan 12
by
Malusi
85
views
1
vote
1
vote
1
answer
2
Souvik33
asked
in
Algorithms
Dec 19, 2022
689
views
Dijkstra's algorithm | Negative Weight Cycle
If a -ve weight cycle is reachable from source, the Dijkstra's algorithm gets into an infinite loop TRUE FALSE
Souvik33
asked
in
Algorithms
Dec 19, 2022
by
Souvik33
689
views
dijkstras-algorithm
graph-algorithm
shortest-path
0
votes
0
votes
1
answer
3
sonalrawat
asked
in
Algorithms
Aug 21, 2023
674
views
We are given a directed graph, represented as an adjacency list, in which each vertex has at least one incoming edge and one outgoing edge. We would like to print out for each vertex j the list of vertices pointing into j. What is the most accurate description of the complexity of computing these quantities in terms of n, the number of vertices, and m, the number of edges? O(n2) O(nm) O(m) O(n)
sonalrawat
asked
in
Algorithms
Aug 21, 2023
by
sonalrawat
674
views
algorithms
time-complexity
8
votes
8
votes
2
answers
4
radha gogia
asked
in
Algorithms
Jul 19, 2015
20,053
views
Given an unsorted array. The array has this property that every element in array is at most k distance from its position in sorted array where k is a positive integer smaller than size of array. Which sorting algorithm can be easily modified for sorting this array and what is the obtainable time complexity?
radha gogia
asked
in
Algorithms
Jul 19, 2015
by
radha gogia
20.1k
views
algorithms
sorting
time-complexity
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy