Instructions

SPT Dijkstra.

Task Limit: 1 task
Time Limit: 30 minuts
Maximum Attempts: 1 time
Require Login

Instruction:
1. Build a given graph (on paper).
2. Using Dijkstra's algorithm, construct a shortest path tree (SPT).
3. Write the order in which nodes are included in the SPT tree.
4. Put your solution in the testing system and send to teacher.


Copyright © 1998 - 2016 IT ACADEMY
Page created in 0.001598seconds - v5.1.20101016
Programmer: Steven Eppler