 |
 |
29 of 32 |  |
 |
 |
MIT
How fast?
l
Easy to perform 1 trial in O(m
)
time
»
just use array of edges, no data structures
l
But need n²
trials: O
(mn²
)
time
l
Simpler than flows, but slower
MIT
How fast?
l
Easy to perform 1 trial in O(m
)
time
»
just use array of edges, no data structures
l
But need n²
trials: O
(mn²
)
time
l
Simpler than flows, but slower
|