OGE Informatics

Russia OGE - Informatics

Graphs And Shortest PathsEnglish
Exam overview

Practice session

A weighted graph between towns A, B, C, D, E has edges: A-B: 3, A-C: 5, B-C: 1, B-D: 4, C-D: 2, C-E: 6, D-E: 3. What is the length of the shortest path from A to E?

Loading your practice session…