Lecture Notes
lec14.pdf
Description:
This resource contains lecture slides on minimum spanning tree, chinese postman problem, network with terminology, examples of nodes & arcs, shortest path problem, node labeling algorithm: Dijkstra, minimum spanning tree (MST) problem, MST example, proof of fundamental property, MST vs. Steiner problem in the Euclidean plane, networks with Euler tour or path, solving manually on a graph, and applications.
Resource Type:
Lecture Notes
pdf
564 kB
lec14.pdf
Course Info
Departments
As Taught In
Fall
2006
Level
Topics
Learning Resource Types
assignment_turned_in
Problem Sets with Solutions
grading
Exams with Solutions
notes
Lecture Notes
menu_book
Online Textbook
