Shortest path in a network

Shortest path in a network

Author: Nazmul Bashar
  1. Students will be able to work out the shortest distance in a network. 
  2. Students will be able to setup the nodes and arcs in a network to problem solve a network activity.

The algorithm we are going to use to determine the shortest path is called “Dijkstra’s algorithm.” Dijkstra’s algorithm is an iterative algorithm that provides us with the shortest path from one particular starting node to all other nodes in the graph. Again this is similar to the results of a breadth first search.

See More
Introduction to Psychology

Analyze this:
Our Intro to Psych Course is only $329.

Sophia college courses cost up to 80% less than traditional courses*. Start a free trial now.