Presentation is loading. Please wait.

Presentation is loading. Please wait.

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.

Published byBenjamin Bennett Modified over 10 years ago

Similar presentations

Presentation on theme: "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."— Presentation transcript:

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

Download ppt "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."

Similar presentations

Decision Maths Dijkstra’s Algorithm.

Decision Maths Dijkstra’s Algorithm.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2001 Chapter 21 Networking and Internetworking Devices.

McGraw-Hill©The McGraw-Hill Companies, Inc., 2001 Chapter 21 Networking and Internetworking Devices.
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet.

Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet.
1 Dijkstra's Shortest Path Algorithm Find shortest path from s to t. s 3 t 2 6 7 4 5 24 18 2 9 14 15 5 30 20 44 16 11 6 19 6.

1 Dijkstra's Shortest Path Algorithm Find shortest path from s to t. s 3 t
1 Dijkstra's Shortest Path Algorithm Find shortest path from s to t. s 3 t 2 6 7 4 5 23 18 2 9 14 15 5 30 20 44 16 11 6 19 6.

1 Dijkstra's Shortest Path Algorithm Find shortest path from s to t. s 3 t
Chapter 7 Network Flow Models.

Chapter 7 Network Flow Models.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 15, Friday, October 3.

MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 15, Friday, October 3.
I.1 ii.2 iii.3 iv.4 1+1=. i.1 ii.2 iii.3 iv.4 1+1=

I.1 ii.2 iii.3 iv.4 1+1=. i.1 ii.2 iii.3 iv.4 1+1=
Shortest path algorithm. Introduction 4 The graphs we have seen so far have edges that are unweighted. 4 Many graph situations involve weighted edges.

Shortest path algorithm. Introduction 4 The graphs we have seen so far have edges that are unweighted. 4 Many graph situations involve weighted edges.
131.123.247.253 -> 131.123.246.52 -> 131.123.11.254 131.123.8.1 131.123.11.254 131.123.247.253 131.123.246.52.

> >
CS541 Advanced Networking 1 Routing and Shortest Path Algorithms Neil Tang 2/18/2009.

CS541 Advanced Networking 1 Routing and Shortest Path Algorithms Neil Tang 2/18/2009.
1 Routing Algorithms. 2 Outline zBellaman-Ford Algorithm zDijkstra Algorithm.

1 Routing Algorithms. 2 Outline zBellaman-Ford Algorithm zDijkstra Algorithm.
I.1 ii.2 iii.3 iv.4 1+1=. i.1 ii.2 iii.3 iv.4 1+1=

I.1 ii.2 iii.3 iv.4 1+1=. i.1 ii.2 iii.3 iv.4 1+1=
The Shortest Path Problem

The Shortest Path Problem
Quickest Route B St Li C La time matrix (minutes) 22 14 16 15 21 10 Liskeard Launceston Callington St Austell Bodmin 32 What is the quickest route from.

Quickest Route B St Li C La time matrix (minutes) Liskeard Launceston Callington St Austell Bodmin 32 What is the quickest route from.
Chapter 4: Finding the Shortest Path Lesson 1: Dijkstra’s Algorithm

Chapter 4: Finding the Shortest Path Lesson 1: Dijkstra’s Algorithm
Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 1.

Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 1.
Dijkstra’s Algorithm. 2 Shortest-path Suppose we want to find the shortest path from node X to node Y It turns out that, in order to do this, we need.

Dijkstra’s Algorithm. 2 Shortest-path Suppose we want to find the shortest path from node X to node Y It turns out that, in order to do this, we need.
Shortest Path Algorithm This is called “Dijkstra’s Algorithm” …pronounced “Dirk-stra”

Shortest Path Algorithm This is called “Dijkstra’s Algorithm” …pronounced “Dirk-stra”
Shortest Path. Dijkstra’s Algorithm finds the shortest path from the start vertex to every other vertex in the network. We will find the shortest path.

Shortest Path. Dijkstra’s Algorithm finds the shortest path from the start vertex to every other vertex in the network. We will find the shortest path.

Similar presentations

Ads by Google