Professional Documents
Culture Documents
G REEDY A LGORITHMS I
earliest-finish-time-first algorithm demo
B
C
A
E
D
F
G
H
time
10
11
10
11
2
B
C
A
E
D
F
G
H
0
time
10
11
10
11
B
0
B
C
A
E
D
F
G
H
0
time
10
11
10
11
B
0
B
C
A
E
D
F
G
H
0
time
10
11
10
11
B
0
C
3
B
C
A
E
D
F
G
H
0
time
10
11
10
11
B
0
B
C
A
E
D
F
G
H
0
time
10
11
10
11
B A
0
B
C
A
E
D
F
G
H
0
time
10
11
10
11
B
0
B
C
A
E
D
F
G
H
0
time
10
11
10
11
B
0
E
3
B
C
A
E
D
F
G
H
0
B
0
time
10
11
10
11
E
3
10
B
C
A
E
D
F
G
H
0
time
10
11
10
11
B
0
D
E
3
11
B
C
A
E
D
F
G
H
0
B
0
time
10
11
10
11
E
3
12
B
C
A
E
D
F
G
H
0
time
10
11
10
11
B
0
E
3
F
6
13
B
C
A
E
D
F
G
H
0
B
0
time
10
11
10
11
E
3
14
B
C
A
E
D
F
G
H
0
time
10
11
10
11
B
0
E
3
15
B
C
A
E
D
F
G
H
0
time
10
11
10
11
B
0
E
3
G
6
16
B
C
A
E
D
F
G
H
0
B
0
time
10
11
10
11
E
3
17
B
C
A
E
D
F
G
H
0
time
10
11
10
11
B
0
E
3
H
6
18
B
C
A
E
D
F
G
H
0
B
0
E
3
time
10
11
10
11
H
6
19
B
C
A
E
D
F
G
H
0
time
10
11
10
11
B
0
E
3
H
6
20