The Gateway to Computer Science Excellence
0 votes
35 views
Which of the following statements is /are FALSE?

I.Given a graph where all edge weights are strictly greater than -3, a shortest path between vertices s and t can be found by adding 3 to the weight of each edge and running Dijkstra’s algorithm from s.

II. Given a directed acyclic graph having positive edge weights and only one source vertex S having no incoming edges, running Dijkstra’s from S will remove vertices from the priority queue in a topological sort order.

III.Given an unweighted directed graph having only one source vertex s having no incoming edges, a depth-first search from s will always generate a DFS tree containing a longest simple path in the graph.
in Algorithms by Junior (853 points) | 35 views

Please log in or register to answer this question.

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,647 questions
56,473 answers
195,393 comments
100,368 users