Dark Mode

Recent questions tagged shortest-path

0 votes

1 answer

1

Testbook CN question
Which of the following statement is/are incorrect about the Routing Information Protocol (RIP) protocol and Open Shortest Path First (OSPF) protocol? RIP packets are sent using TCP. OSPF packets are sent using TCP. RIP is an Network Layer protocol OSPF is an Application Layer protocol

Sahil_Lather asked in Computer Networks Jan 27

by Sahil_Lather

109 views

1 vote

1 answer

2

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

335 views

1 vote

0 answers

3

TIFR CSE 2022 | Part B | Question: 13
Consider a directed graph $G=(V, E)$, where each edge $e \in E$ has a positive edge weight $c_e$. Determine the appropriate choices for the blanks below so that the value of the following linear program is the length of the shortest directed path in $G$ from $s$ ... $\text{blank }1: \min, \text{blank }2:\; \geq$ $\text{blank }1: \min, \text{blank }2:\; =$

admin asked in Algorithms Sep 1, 2022

by admin

104 views

0 votes

2 answers

4

Made Easy Test Series
Which of the following can be the best algorithm(s) for all pair of the shortest path problem? I. ‘V’ invocations of Dijkstra algorithm ⇒ Ο(VE logV). II. ‘V’ invocations of Bellman-Ford algorithm ⇒ Ο(V2 E). III. ‘1’ invocations of Floyd-Warshall algorithm ⇒ Ο(V3).

LRU asked in Algorithms Jan 8, 2022

by LRU

240 views

0 votes

1 answer

5

Nptel Assignment Question
Consider the following strategy to convert a 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, ... all graphs. The claim is true for connected acyclic graphs. The claim is not true in general for connected graphs with cycles

rsansiya111 asked in Algorithms Dec 8, 2021

399 views

0 votes

1 answer

6

NPTEL Assignment Question
Consider the following strategy to solve the single source shortest path problem with edge weights from source s. 1. Replace each edge with weight w by w edges of weight 1 connected by new intermediate nodes 2. Run BFS(s) on the modified graph to ... 's algorithm.s st This strategy will not solve the problem correctly. This strategy will only work if the graph is acyclic.

rsansiya111 asked in Algorithms Dec 8, 2021

438 views

0 votes

1 answer

7

NPTEL Assignment Question
Let G be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE? P: Minimum spanning tree of G does not change Q: Shortest path between any pair of vertices does not change P only Q only Neither P nor Q Both P and Q

rsansiya111 asked in Algorithms Dec 7, 2021

325 views

0 votes

1 answer

8

NPTEL Assignment Question

rsansiya111 asked in Algorithms Dec 7, 2021

199 views

Page:

1
2
3
4
next »

Recent questions tagged shortest-path