4.1.1 If all of the valencies in a graph
are even, the that graph is
Eulerian and therefore traversable
4.1.2 If the graph has just two valencies that are odd, then
the graph is semi-Eulerian. In this case, the start and
finish points will be the two vertices with odd valencies
4.1.3 A graph is not traversable if it has more than two odd valencies
4.2 Finding the shortest route in a network
4.2.1 For semi-Eulerian graph,
the shortest path between
the two odd vertices will
have to be repeated
4.2.2 Algorithm
4.2.2.1 1 ~ Identify any vertices with odd valency
4.2.2.1.1 2 ~ Consider all possible pairings of these vertices
4.2.2.1.1.1 3 ~ Select the complete pairing that has the least sum
4.2.2.1.1.1.1 4 ~ Add a repeat of the arcs indicated
by this pairing to the network
4.3 Traversable ~ sum of each arc's weight will be the weight of the network
5 Chapter 5 ~ Critical Path Analysis
5.1 Precedence Table/Dependence Table
5.1.1 Shows what
must be
completed for
an activity to
start
5.1.2 Used to create activity network
5.1.2.1 0 node ~ source node
5.1.2.2 Last node ~ sink node
5.1.2.3 Often can take a couple of
times to get layout correct
5.2 Dummies
5.2.1 Each activity must be
uniquely represented
5.2.2 C depends on A but D
depends on A and B
5.3 Early and Late event times
5.3.1 Early ~ use largest number
5.3.1.1 From a forward pass/forward scan
5.3.2 Late ~ use smallest number
5.3.2.1 From a backward pass/backward scan
5.3.3 Total float = latest finish time -
duration - earliest start time
5.3.4 Cascade (Gantt) Charts
5.3.4.1 Shows time leeway
5.3.4.2 Dotted box represents float
5.3.4.3 Look halfway before to see how many activities
5.3.4.3.1 Consider float
5.4 Critical activities
5.4.1 Change to time would impact overall time
5.4.1.1 At each node, early event time = late event time