Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
noob_coder
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by noob_coder
0
votes
2
answers
1
Made Easy Workbook
Suppose that you are running Dijkstra’s algorithm on the edge-weighted diagram below, starting from vertex A. The Table gives ‘Distance’ and ‘Parent’ entry of each vertex after vertex E has been deleted from the priority queue and relaxed. Vertex Distance Parent A 0 Null B 2 A C 13 F D 23 A E 11 F F 7 B G 36 F H 19 E What could be the possible value of expression x+y?
Suppose that you are running Dijkstra’s algorithm on the edge-weighted diagram below, starting from vertex A. The Table gives ‘Distance’ and ‘Parent’ entry of ...
2.2k
views
asked
Mar 10, 2019
Algorithms
algorithms
graph-algorithm
dijkstras-algorithm
numerical-answers
made-easy-booklet
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register