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.