+
Shortest path by Dijkstra method  :  network

Shortest path by Dijkstra method : network

Rating:
Rating
(0)
Author: Nazmul Bashar
Description:

We will be able to work out the shortest distance between two points in a network.

We will be able to use Dijkstra's Algorithm to find the shortest distance.

Dijkstra method is not the only way to work out the shortest path between two nodes (points) in the network. This is more formal and methodical. Practically this method does not require any Mathematics. It is expected, when you finish watching the video, that you take down important points. Especially, the step by step procedure is given in one of the slides. Please make your own personal note, either on Google Doc or on your notebook.

(more)
See More

Try Our College Algebra Course. For FREE.

Sophia’s self-paced online courses are a great way to save time and money as you earn credits eligible for transfer to over 2,000 colleges and universities.*

Begin Free Trial
No credit card required

25 Sophia partners guarantee credit transfer.

221 Institutions have accepted or given pre-approval for credit transfer.

* The American Council on Education's College Credit Recommendation Service (ACE Credit®) has evaluated and recommended college credit for 20 of Sophia’s online courses. More than 2,000 colleges and universities consider ACE CREDIT recommendations in determining the applicability to their course and degree programs.

Tutorial

Chinese postman problem

In 1962, a Chinese mathematician called Kuan Mei-Ko was
interested in a postman delivering mail to a number of streets
such that the total distance walked by the postman was as short
as possible. How could the postman ensure that the distance
walked was a minimum?
In the following example a postman has to start at A, walk along
all 13 streets and return to A. The numbers on each edge
represent the length, in metres, of each street. The problem is to
find a trail that uses all the edges of a graph with minimum
length.

Full Screen