Graph Theory Unit 2.

Slides:



Advertisements
Similar presentations
Chapter 3: Planning and Scheduling Lesson Plan
Advertisements

Gantt and PERT charts. Representing and Scheduling Project Plans Gantt Charts Useful for depicting simple projects or parts of large projects Show start.
Tutorial 2 Project Management Activity Charts (PERT Charts)
Module 5 – Networks and Decision Mathematics Chapter 24 – Directed Graphs.
Graph Algorithms: Minimum Spanning Tree We are given a weighted, undirected graph G = (V, E), with weight function w:
Business Studies Grade 11.
D1: Matchings.
Strategic Management. What is Strategic Management? The set of decisions and actions that result in the formulation and implementation of plans designed.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley. All rights reserved.
CS 2813 Discrete Structures
Chapter 9 – Graphs A graph G=(V,E) – vertices and edges
Chapter 11 Management Functions and Decision Making
Graph Theory Topics to be covered:
Critical Path Analysis
Lecture 3 Scheduling CSCI – 3350 Software Engineering II Fall 2014 Bill Pine.
Graphs Their Applications. NC Standard Course of Study Competency Goal 1: The learner will use matrices and graphs to model relationships and solve problems.
7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.
© Jalal Kawash 2010 Graphs Peeking into Computer Science.
PROJECT MANAGEMENT Approaches
May 18, 2015 Turn in propaganda 'poster', read chapter 10, characterization, prepare for Around the Horn (5/20)
Family Planning Research Center of Nigeria Case Study
Vertex-Edge Graphs Euler Paths Euler Circuits. The Seven Bridges of Konigsberg.
Walks, Paths and Circuits. A graph is a connected graph if it is possible to travel from one vertex to any other vertex by moving along successive edges.
Introduction to Graph Theory
Prims Algorithm for finding a minimum spanning tree
1) Find and label the degree of each vertex in the graph.
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
I can describe the differences between Hamilton and Euler circuits and find efficient Hamilton circuits in graphs. Hamilton Circuits I can compare and.
Planning and Scheduling.  A job can be made up of a number of smaller tasks that can be completed by a number of different “processors.”  The processors.
Unit 2 Hamiltonian Circuits. Hamiltonian Circuit: A tour that starts at a vertex of a graph and visits each vertex once and only once, returning to where.
Unit – graph theory. Concept Characteristics What is a Graph……Really?
Stats day 7 Final Chapter 3 Day.
ECE362 Principles of Design
Graphing Quadratic Functions
Data Collecting, Organizing & Analyzing
Redraw these graphs so that none of the line intersect except at the vertices B C D E F G H.
Topological Sort In this topic, we will discuss: Motivations
Minimum Spanning Tree Chapter 13.6.
Task Tables Draw a graph for the following task table.
Eleanor Roosevelt High School
Critical Path Analysis (CPA)
2-5 Absolute Value Functions and Graphs
What is the next line of the proof?
Chapter 2: Business Efficiency Lesson Plan
Evaluate Logarithms and Graph Logarithmic Functions
UNIT 1: EULER CIRCUITS GRAPH THEORY.
Chapter 2: Business Efficiency Lesson Plan
Connected Components Minimum Spanning Tree
Graph Theory Unit 2.
Graph Theory Unit 2.
AQR Unit 7 Discrete Mathematics
Work Plans The secret for success!.
Objective Vocabulary Solve linear programming problems.
Scheduling Theory By Sarah Walker 12/4/2018.
Kruskal’s Algorithm for finding a minimum spanning tree
Critical Path Method Farrokh Alemi, Ph.D.
Lesson Objective Understand Cascade diagrams and be able to use them to draw resource histograms.
Analyzing MOSAIC USA DemographicsNow Denver Public Library.
PROJECT MANAGEMENT (BSBI 622)
Walks, Paths, and Circuits
Graph Theory Unit 2.
A path that uses every vertex of the graph exactly once.
6.6 Analyzing Graphs of Quadratic Functions
Activity Networks
Activity Networks
3.1 Earliest Start Times.
Planning and Scheduling
Planning and Scheduling
Chapter 3: Planning and Scheduling Lesson Plan
Doing Project Work – Conclusion
Presentation transcript:

Graph Theory Unit 2

2.11 Critical Path

The Art of Multi-tasking Cooking Dinner Let’s make a steak and potato dinner We want: Salad Baked Potatoes BBQ Steak How do we get it all done? The Art of Multi-tasking

Multi-tasking Certain jobs will take your full concentration, but then you get it to a point and “there’s no need to watch the kettle boil” If you do, your jobs will take you a lot longer to complete. This leads us to planning your process

*things that MUST be done first* Planning Process You can make a list of all of the tasks that much be completed and the amount of time each task takes. On this list you would also include any ‘prerequisite tasks’* *things that MUST be done first* Task Description Time Prerequisite A B

Example: Starting a Company Step Description Execution Time (days) Prior Steps A Preparing a business plan 30 None B Conducting market research 10 C Looking for partners 25 D Looking for a location 20 E Analyzing the market research 5 F Evaluating the product-distribution systems 15 C and D G Arranging for financing 35 E and F H Launching the company

Turning Chart into a Graph You are reading the chart one row at a time from right to left There will always be at least one vertex with NO Prerequisite Steps Start with this vertex Next, identify the vertices that name that vertex as their prerequisite steps. Draw these to the right of the first vertex, connect with a directed edge and weight the edges with the time it takes to complete the prerequisite step. Continue with this process until all steps are accounted for

The Final Graph Vertices represent Tasks Parallel paths represent series of tasks that can be carried out simultaneously (multi-tasking)

Questions Which is the first task that must be completed? Which is the last task that will be completed? What are all of the possible paths from start to finish?

Critical Path The Critical Path is the LONGEST path from the start of the project to the finish. You do not have to go to/through every vertex This is because you are multitasking The Critical Path represents the MINIMUM AMOUNT OF TIME it would take to complete the entire project.

Questions Which of the following paths is the critical path? ABEGH = 80 ACFGH = 105 ADFGH = 100 What is the minimum amount of time it would take to Start this Company?

*great practice for common exam questions* Visions Book 2 Page 52 #3, 5, 17, 19, 21* *great practice for common exam questions*

2.11 Practice 2 Carousel Page 120 #1-5