Download presentation

Presentation is loading. Please wait.

Published byBenjamin Bennett Modified over 3 years ago

1
For each of the following networks: Use Dijkstra's algorithm to find a quickest route between the stated vertices Indicate the order in which the vertices were labelled, Show clearly how you determined your quickest route from your labelling. Is the route you have found the only quickest route? Give a reason for your answer.

2
Shortest route between A and H

3
Shortest Route between S and T

4
Shortest route between A to J

5
Answers to questions (i)Labelling orderA C B D F E G H Shortest RouteA B F H (ii)Labelling orderS C B A E D G F T Shortest RouteS C E F T (iii)Labelling orderA B C D E F H G I J Shortest RouteJ H E C Aor J H E D A

Similar presentations

OK

TNMK09 Computer Networks Copyright © 2005 Di Yuan, ITN, LiTH 1 Non-hierarchical routing, static or dynamic, won’t work in the Internet None of the.

TNMK09 Computer Networks Copyright © 2005 Di Yuan, ITN, LiTH 1 Non-hierarchical routing, static or dynamic, won’t work in the Internet None of the.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on chapter electricity for class 10th Mobile ip seminar ppt on 4g Ppt on slum areas in india Ppt on asymptotic notation of algorithms book Ppt on event management business plan Ppt on mauryan period Ppt on aircraft landing gear systems Ppt on market friendly state Ppt on product specification form Download ppt on conservation of fossil fuels