diff options
| author | mo khan <mo@mokhan.ca> | 2025-09-30 16:10:16 -0600 |
|---|---|---|
| committer | mo khan <mo@mokhan.ca> | 2025-09-30 16:10:16 -0600 |
| commit | aa4ac255b65b6d9026e58c508b9d7de8c27cf350 (patch) | |
| tree | b25fdb5dc10f77a546784f18acb5b1205bd563b9 /assignments/2 | |
| parent | 98e5eff870009e8f42c599c1bd1b78dc8f3b9cb7 (diff) | |
fix reference to graph image
Diffstat (limited to 'assignments/2')
| -rw-r--r-- | assignments/2/README.md | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/assignments/2/README.md b/assignments/2/README.md index 9fab554..1b37a5c 100644 --- a/assignments/2/README.md +++ b/assignments/2/README.md @@ -254,7 +254,7 @@ which is better known as Dijkstra's shortest path algorithm. > b) Consider the network shown in the following diagram. With the indicated link costs, use Dijkstra's shortest path algorithm to compute the shortest path from x to all other network nodes. Show how the algorithm works by computing a table like the one above. - + ```ruby adjacency_list = { |