1
Q
What are the colours for graphs and trees
A
White - Vertex not yet discovered
Grey - Vertex discovered, but not finished
Black - Vertex finished
2
Q
What are the timestamps for graphs and trees
A
v.d - time at which the vertex is discovered (when it is greyed)
v.f - time at which it is finished (when it is blackened)
3
Q
A
Y1 Algorithms and Data Structures
flashcards
Decks in class (13)
# Cards
-
0.0 Insert, FindMax, ExtractMax, IncreaseKey8
-
2.1 Merge Sort9
-
2.2 Runtime Analysis10
-
3.1 Heap Sort27
-
4.1 Probabilities7
-
4.2 Quicksort6
-
5.1 Linear Time Sorting10
-
5.2 Stacks, Queues and Lists19
-
6.1 Binary Search Trees16
-
7. 1 Red-Black Trees10
-
7.2 Dynamic Programming2
-
8.1 Greedy Algorithms4
-
8.2 Graphs3
