Dijkstra and Shortest Path Algorithms - Typical Problems

Download Q&A
Q. If a graph has 5 vertices and 7 edges, what is the maximum number of edges it can have?
  • A. 10
  • B. 15
  • C. 20
  • D. 25
Q. Which of the following is NOT a typical application of Dijkstra's algorithm?
  • A. GPS navigation systems
  • B. Network routing protocols
  • C. Finding the maximum element in an array
  • D. Flight scheduling
Showing 1 to 2 of 2 (1 Pages)
Soulshift Feedback ×

On a scale of 0–10, how likely are you to recommend The Soulshift Academy?

Not likely Very likely