This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Summary of what you have learned up to Prelim 1 (ENGRI 115, Fall 2007) What is Operations Research? Real world problem (application) → Model → Algorithm → Validation. Graph definitions • Graph, nodes (vertices), edges (arcs). Undirected graph, directed graph. Simple graph (no loops or multiple edges). • Subgraph, spanning subgraph. • Connected graph, components of a graph. • Path, directed path, cycle, directed cycle, acyclic graph (forest), acyclic directed graph, tree, spanning tree, leaves. • Costs on edges. Cost of a path, cost of a tree. • Flow, value of flow. Capacities on arcs. Cut, capacity of a cut. The Minimum Spanning Tree Problem • Applications: Communication/Power network between geographical locations; Compact Data Storage. • Model: Undirected graph represents the network, assign costs to edges, find spanning tree that has minimal total cost . • Algorithms: Prim’s Algorithm , Kruskal’s (Greedy) Algorithm , Reverse Greedy Algorithm , Decrementing Edge Algorithm (start with spanning tree and look for improving edges)....
View
Full
Document
This note was uploaded on 02/28/2008 for the course ENGRI 1101 taught by Professor Trotter during the Fall '05 term at Cornell.
 Fall '05
 TROTTER

Click to edit the document details