A finite series of instructions which are carried out to solve a problem
4 of 21
Order
The total number of arcs entering/ ending at the node
5 of 21
Connected graph
A graph where every node is connected to every other node
6 of 21
Simple graph
A graph where there are no loops or multiple edges
7 of 21
Walk
A sequence of arcs such that the end node of one arc is the start of the next
8 of 21
Path
A walk which doesn't repeat nodes
9 of 21
Trail
A walk where no arc is visited more than once
10 of 21
Cycle
A closed walk where only the start and finish node are the same
11 of 21
Hamiltonian cycle
A cycle where every node is visited
12 of 21
Eulerian
A trail which visits every edge once before returning to the start
13 of 21
Semi- Eulerian
A trail which visits every edge once but starts and finishes on different nodes
14 of 21
Tree
A connected graph with no cycles
15 of 21
Complete graph
A simply connected graph where each node is directly connected to every other node
16 of 21
Bipartite graph
A graph with 2 sets of nodes such that edges only connect nodes from one set to another
17 of 21
MST
A spanning tree of minimum weight for a network
18 of 21
Planar graph
A graph that can be drawn so that no 2 edges meet except at a node
19 of 21
Critical activities
Activities where the float is 0, delaying these causes the whole project to be delayed
20 of 21
Dummy activities
Used to prevent a pair of activities sharing the same start and end point or of 2 activities share 2 preceding activities but 1 also has another precedent
21 of 21
Other cards in this set
Card 2
Front
Vertex
Back
Node
Card 3
Front
Edge
Back
Card 4
Front
A finite series of instructions which are carried out to solve a problem
Back
Card 5
Front
The total number of arcs entering/ ending at the node
Comments
No comments have yet been made