Alerts Wishlist Cart

Dijkstra and Shortest Path Algorithms - Competitive Exam Level

Download Q&A
Q. If a graph has 5 vertices and 7 edges, what is the maximum number of edges in a complete graph with 5 vertices?
  • A. 10
  • B. 12
  • C. 15
  • D. 20
Q. Which algorithm can be used as an alternative to Dijkstra's algorithm for graphs with negative weights?
  • A. Prim's algorithm
  • B. Kruskal's algorithm
  • C. Bellman-Ford algorithm
  • D. A* algorithm
Showing 1 to 2 of 2 (1 Pages)
Biology (School & UG)
Biology (School & UG)
Chemistry (School & UG)
Chemistry (School & UG)
Civil Engineering
Civil Engineering
Commerce & Accountancy
Commerce & Accountancy
Computer Science & IT
Computer Science & IT
Current Affairs & GK
Current Affairs & GK
Data Structures & Algorithms
Data Structures & Algorithms
eBooks
eBooks
Electrical & Electronics Engineering
Electrical & Electronics Engineering
English (School)
English (School)
General Aptitude
General Aptitude
General Knowledge
General Knowledge
General Knowledge & Current Affairs
General Knowledge & Current Affairs
Languages & Literature
Languages & Literature
Law & Legal Studies
Law & Legal Studies
Major Competitive Exams
Major Competitive Exams
Mathematics (School)
Mathematics (School)
Mechanical Engineering
Mechanical Engineering
Medical Science
Medical Science
Physics (School & Undergraduate)
Physics (School & Undergraduate)
Quantitative Aptitude & Reasoning
Quantitative Aptitude & Reasoning
Social Science (School)
Social Science (School)
Technical
Technical
Verbal and Reasoning
Verbal and Reasoning
Vocational & Skill Development
Vocational & Skill Development
Soulshift Feedback ×

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

Not likely Very likely