This classe verify the cut crition critere on a input network
Condition : The input network have to be valid :
each vertex have : input + output + number of links <= 4
each block (set of adjacant vertices that have input > 0) do not form a circuit
Post relation : a boolean say if the network is K-Fault Tolerant
Provides an algorithm to find blossom inequalities which are violated
or prove that no such inequality exists
We have as entry : one graph G, one map s <=> b(s),
one solution x of the LP,which is a map e <=> x(e),
a map e <=> C(e) where C(e) is the capacity of the edge e
The ProtectionRoutingFullPath class provides an algorithm to compute and
solve the problem of WDM network with two levels, a cable graph and a request
graph.
The ProtectionRoutingFullPathSum class provides an algorithm to compute and
solve the problem of WDM network with two levels, a cable graph and a request
graph.
The ProtectionRoutingGlobal class provides an algorithm to compute and solve
the problem of WDM network with two levels, a cable graph and a request
graph.
The ProtectionRoutingGlobalSum class provides an algorithm to compute and
solve the problem of WDM network with two levels, a cable graph and a request
graph.
The ProtectionRoutingLocal class provides an algorithm to compute and solve
the problem of WDM network with two levels, a cable graph and a request
graph.
The ProtectionRoutingLocal class provides an algorithm to compute and solve
the problem of WDM network with two levels, a cable graph and a request
graph.