Complexity Assuming integer-valued A, step 1, which finds the constrained cheapest shortest paths over all the nodes, has O(n3A) time complexity. This is because all pairs of end and intermediate nodes have to be examined, for all integer delay values from 1 to A. Step 2, which constructs the constrained MST on the closure graph having k nodes, has O(k3) time complexity. Step 3,whichexpandstheconstrainedspanningtree,involvesexpandingthekedgestoupton−1edgeseachandtheneliminatingloops.ThishasO(kn)time overhead. The dominating step is step 1.
đang được dịch, vui lòng đợi..