Graphs & Their Applications
PRESENTED BY: Wesley S.
Task Table - a table that lists the actions of an activity from start to finish. (example #1 below)
example #1 :
Task Time (s) Prerequisites
| A. Walk To Car | 10 | none |
| B. Unlock Door | 5 | A |
| C. Open Door | 1 | A, B |
| D. Sit Down | 3 | C |
| E. Close Door | 1 | D |
| F. Key In Ignition | 1 | D, E |
| G. Put On Seat Belt | 4 | E, F |
| H. Check Mirrors | 6 | E, F, G |
| I. Start Car | 2 | F, H |
Critical Path
critical path - the tasks critical to the earliest completion of the project from start to finish.
The critical path is not the actual shortest path. What you do is find every single type of path possible from the graph.. The one that takes the longest out of all of those paths is the critical path. Take the graph below.
The critical path here is: ABCDEGHI
Hamiltonian Circuits & Paths
Hamiltonian Path - a path that uses each vertex of a graph exactly once.
Hamiltonian Circuit - a path that uses each vertex once and ends at the starting vertex.
For Instance the graph below of a pentagon the path touches each vertex without having to touch a vertex more than once, that is considered a Hamiltonian Path and Circuit because it ends at the starting vertex. A
example # 2
Quote:
" It's Good to shut up sometimes "
~ Marcel Marceau ~
(Responsibility)