Definitions Flashcards
Isomorphic graph
Graph showing same information but drawn differently
Complete graph
A graph in which all it’s vertices Ade connected
Path
- A limited sequence of edges
- End vertex of one edge = start vertex of the next
- no vertex appears more than once
Walk
• A Path where you can return to vertices more than once
Digraph/Directed graph
A graph in which the each edge has a direction
Spanning tree
- subgraph of a graph which includes all vertices of the graph
- also a tree
Isomorphic graph
Graph with same information drawn differently
Adjacency matrix
Records number of direct links between vertices
Semi-eulerian graph
- Exactly 2 nodes have odd valency
* semi traversable
Early event time
Earliest time which all dependant events may be completed
Late event time
Latest time dependent events may be completed without delaying project
Critical activity
Increase in duration causes increase in project duration
Critical path
Path from start to end mode following critical activities
Total float
Amount of time start can be delayed without affecting project duration
Dummies
- unique representation of activities in terms of end events
- if D depends only on B but E depends on B and C
