Code@LTH 2022#6 - Dijkstras algorithm
Problems
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Single source shortest path, non-negative weights | 6/11 (55%) | 1.38 | 1.33 |
| B | Full Tank? | 1/3 (33%) | 1.50 | 2.00 |
| C | Flygskam | 2/4 (50%) | 1.00 | 1.00 |
| D | Arriving on Time | 1/2 (50%) | 1.00 | 1.00 |
| E | Customs Controls | 0/0 (0%) | -- | -- |
| F | Emptying the Baltic | 0/1 (0%) | 1.00 | -- |
| G | Coffee Date | 1/1 (100%) | 1.00 | 1.00 |
| H | Eco-driving | 0/0 (0%) | -- | -- |
| I | A Walk Through The Forest | 1/1 (100%) | 1.00 | 1.00 |
| J | Detour | 1/2 (50%) | 1.00 | 1.00 |
| K | Destination Unknown | 1/2 (50%) | 2.00 | 2.00 |