Contenuti
Networks and Dynamic Programming
Introduction to minimal spanning trees and algorithms associated with finding these.
Introduction to Bellman's Principle of Optimality and Dijkstra’s algorithm to find the shortest paths in a weighted directed network.
