|
A*-Algorithmus
|
248 |
2 |
48 |
7 |
3.1 |
|
Algorithmus von Hopcroft und Karp
|
225 |
9 |
24 |
5 |
3.4 |
|
Algorithmus von Kruskal
|
63 |
4 |
8 |
2 |
2.4 |
|
Algorithmus von Prim
|
149 |
16 |
20 |
7 |
1.9 |
|
Anseilen
|
94 |
12 |
37 |
7 |
3.5 |
|
B-Baum
|
137 |
17 |
29 |
2 |
3.4 |
|
Baumkalkül
|
528 |
22 |
13 |
10 |
2.2 |
|
Binärer Suchbaum
|
141 |
16 |
24 |
4 |
3.5 |
|
Binäres Entscheidungsdiagramm
|
204 |
15 |
24 |
9 |
2.6 |
|
Blaues Band
|
34 |
9 |
8 |
2 |
1.5 |
|
Collatz-Problem
|
143 |
11 |
8 |
3 |
1.4 |
|
DB2
|
203 |
10 |
12 |
6 |
2.8 |
|
Dijkstra-Algorithmus
|
237 |
26 |
44 |
14 |
2 |
|
Finsterniszyklen
|
137 |
4 |
14 |
3 |
2.7 |
|
Fletcher-Klasse
|
282 |
13 |
21 |
10 |
3.8 |
|
Fünf-Farben-Satz
|
243 |
22 |
48 |
14 |
1.2 |
|
Goldberg-Tarjan-Algorithmus
|
42 |
8 |
57 |
13 |
2.9 |
|
Graph (Graphentheorie)
|
96 |
13 |
12 |
7 |
2.2 |
|
Hamiltonkreisproblem
|
206 |
6 |
14 |
10 |
3 |
|
Heapsort
|
115 |
9 |
21 |
14 |
1.4 |
|
