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: Programming Assignment #5 CS163: Data Structures Purpose: The purpose of this last program is to get an idea of how useful graphs are and how complicated relationships can be simplified using an adjacency list. ***The key with this assignment is to keep it simple and experience the power of an adjacency list *** Problem Statement: We learned that graphs are useful when working with situations where there are more complex relationships. Use a graph to map out the daily events/tasks that happen around your life. Are there events that happen in parallel? Once one event happens what next can occur? So, for example, to begin working I fire up at least 3 computers, each having their own job: answering email, uploading or performing file conversion on the others. All in parallel. My tasks are done once I finish on all three computers. Once finished, I can move on to the next eventYou might want to bring other people into the equation to...
View Full Document
This note was uploaded on 10/16/2011 for the course CS 163 taught by Professor Fant during the Spring '09 term at Portland State.
- Spring '09