chapter6 traveling salesman problem（chapter6货郎担问题）.docVIP

Chapter 7 Mathematics of Networks ESSENTIAL QUESTIONS: Section 7.1: How is a tree different from other graphs? Section 7.2: What is a spanning tree? Section 7.3: How do you use Kruskal’s Algorithm to find Minimum Spanning Tree (MST)? Section 7.4: How can you find the shortest network connecting 3 points? WORD WALL: INTERIOR JUNCTION RULE INTERIOR JUNCTION POINT JUNCTION POINT KRUSKAL’S ALGORITHM MINIMUM NETWORK PROBLEMS MINIMUM SPANNING TREE (MST) NETWORK REDUNDANCY SHORTEST NETWORK SHORTEST NETWORK RULE SPANNING TREE STEINER POINT STEINER TREE SUBGRAPH TREE HOMEWORK: 7.1: p. 259 # 1, 2, 3 – 7 (odd) 7.2: p. 260 #11 – 12 (all), 16 – 18 (all) 7.3: pp. 260 – 1 # 19 – 25 (odd) 7.4: DAY ONE: Triangle Worksheet and DAY TWO: p. 262 # 27-34 Section 7.1: Tree What is a NETWORK? Any CONNECTED GRAPH Vertices of networks are often called nodes or terminals and represent “objects” cities, subway stations, computer servers, people, etc Edges of networks are called links and indicated connections among objectsairline routes, rail lines, internet connections, social connections, etc CHAPTER THEME: Finding optimal networks that connect a set of points the cheapest OPTIMAL NETWORK GOALS: Connect all the “TERMINALS” = Vertices “CONNECT” DOESN’T HAVE TO MAKE an euler/ hamilton path or circuit Total cost (length) of the network as small as possible (optimal) Example Network Problem: The weighted graph represents a system of roads connecting buildings of a company’s headquarters. The company is planning to upgrade its fiber optic cable through underground lines connecting its servers. The weights represent cost in millions of dollars to upgrade these cables between each building. The goal for the company is to find a network that utilizes the existing network of roads; connects all the buildings together; has the least cost. Key Term Requirements of network in the example: SUBGRAPH: edges come from the original graph SPAN: must include all vertices of t