Lecture Notes for
stringlengths
1
100
Unnamed: 1
stringclasses
7 values
Unnamed: 2
float64
Unnamed: 3
float64
Prim’s algorithm, 62, 114 simple path, 99
null
null
null
primary clustering, 94 size, 9, 25, 26, 32, 37, 89
null
null
null
primary position, 92, 94 smoothing, 102, 103
null
null
null
primitive, 32 sorting, 23, 40, 47, 63
null
null
null
124sorting strategies, 64
null
null
null
space complexity, 25
null
null
null
spanning tree, 114
null
null
null
sparse, 101, 111, 112
null
null
null
specification, 6, 22, 85
null
null
null
stability, 71, 72, 74, 77, 80
null
null
null
stack, 16, 38, 104
null
null
null
storing, 9, 12, 40, 51, 85
null
null
null
strongly connected, 100
null
null
null
subdivision, 102–104
null
null
null
subgraph, 102–104, 114
null
null
null
supergraph, 102
null
null
null
symmetric, 101
null
null
null
table, 85
null
null
null
three phase, 84
null
null
null
three-cells, 18
null
null
null
tight, 106
null
null
null
time complexity, 25, 26, 64
null
null
null
time complexity, constant, 15
null
null
null
time complexity, linear, 15, 23, 58, 104
null
null
null
time complexity, logarithmic, 24, 27
null
null
null
time complexity, quadratic, 70
null
null
null
top, 16, 18
null
null
null
trade-off, 25, 117
null
null
null
Travelling Salesman Problem, 65, 99, 117
null
null
null
traversal, 104
null
null
null
tree, 31, 100
null
null
null
tree rotations, 48, 49
null
null
null
trees as arrays, 51
null
null
null
Treesort, 71
null
null
null
two-cells, 12
null
null
null
undirected, 99
null
null
null
upper bound, 64
null
null
null
value, 31
null
null
null
Vehicle Routing Problem, 117
null
null
null
verification, 6, 10
null
null
null
vertices, 31, 99
null
null
null
von Mises birthday paradox, 88
null
null
null
Wagner’s theorem, 104
null
null
null
weakly connected, 100
null
null
null
weight matrix, 100
null
null
null
weighted, 99
null
null
null
worst case, 25, 30, 65, 78
null
null
null
XML, 14
null
null
null
125
null
null
null