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: CSE 100 Programming Assignment One W.A. Burkhard Due: Januarh 27, 2012 Topological Sorting Let’s begin with several examples each utilizing topological sorting. Often large industrial projects are managed with the aid of a PERT chart. PERT is short for Program Evaluation and Review Technique; PERT provides a mechanism to analyze dependencies among various portions of a project allowing each to obtain a timely start time to obtain the shortest possible completion time for the entire project. The chart is a directed graph in which a node represents a portion of the project and an arc represents the time required to complete to portion of the project at the head of the arc. Another example involves writing documentation of a large program as well as user manuals. Suppose one portion of the program A must be understood before another portion B ; within a directed acyclic graph, in which each node represents a portion of the program, the arc ( A, B ) would represent this dependency. Consider the updating process within a spreadsheet program. The value of one cell may depend upon the value of another. And this dependency may extend to other cells as well. The spreadsheet program must know these dependencies and updating must proceed from the known to the unknown. The dependencies can be represented as arcs within a directed graph in which the nodes represent the cells....
View Full Document
This note was uploaded on 03/27/2012 for the course CSE 100 taught by Professor Staff during the Winter '08 term at UCSD.
- Winter '08
- Data Structures