GATE 2021 AR – Question 50

Urban Land Use and Transportation · Aggregate and disaggregate transport demand models and forecasting · 2 marks · Multiple select

Which algorithms find shortest paths in a transport network?

Logit
Huff
Floyd–Warshall
Dijkstra

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (C) Floyd–Warshall; (D) Dijkstra

Explanation

Floyd–Warshall computes shortest paths between all vertex pairs; Dijkstra computes shortest paths from a source under nonnegative edge weights. Thus C, D. Logit and Huff are choice/interaction models, not these shortest-path algorithms.

More Aggregate and disaggregate transport demand models and forecasting questions

GATE 2026 AR — Planning Q63 – Daily light-rail demand is Q=43000−850P, with fare P in rupees. If fare falls from₹30…
GATE 2025 AR — Architecture Q49 – Metro ridership 367200/day will replace 18% of existing trips. Existing shares are…
GATE 2025 AR — Planning Q49 – Metro ridership 367200/day will replace 18% of existing trips. Existing shares are…
GATE 2025 AR — Planning Q55 – Which traffic-analysis-zone statements are correct?
GATE 2025 AR — Planning Q64 – Mode attributes(cost₹, in-vehicle min, out-of-vehicle min) are rail(20, 20, 10), bus(10,…
GATE 2024 AR — Planning Q63 – An EcoCity park has inverse demand P=1500−7.5Q, where P is ticket price₹ and Q integer…

All Aggregate and disaggregate transport demand models and forecasting questions →