|
||||||||||
| PREV LETTER NEXT LETTER | FRAMES NO FRAMES | |||||||||
fname.
fname and populates this with keys and
values found there.
e and reverse(e)
are not in the failed state anymore.
zinf.id.
instance at the end of the objects list
and registers it as the instance for the
class instance.getClass().
e and
reverse(e).
TED.recoverBidiLink(E, int) for each element in links
and sets the residual capacity of both link directions to
the valure returned by TED.getLinkCap(E).
TED.reinstallBidiLinks(java.util.Collection, int) .
id.
key from this table.
e.
key from the map and returns the constant value.
c by repeatedly
calling SdiGraph.removeEdge(E).
c by repeatedly
calling SdiGraph.removeVertex(V).
e from this graph.
v from this graph and all its associated
edges.
TED.registerBidiLinkFailure(E) for each link in
failed and sets the residual capacity of both link directions
to zero.
e, or null if such an edge does not exist.
val_prop.
mean and
standard deviation (sigma).
mean and
standard deviation (sigma), with the randomness source
set to rnd.
rnd as the randomness source.
mean and
standard deviation (sigma).
mean and
standard deviation (sigma), with the randomness source
set to rnd.
mean and
standard deviation (sigma).
mean and
standard deviation (sigma), with the randomness source
set to rnd.
rnd as the
randomess source.
max), that is excluding max.
max), that is excluding max, using
rnd as the randomness source.
RoutingAlg as well as additional methods
useful for routing algorithms.src and
dest.
src and dest.
NoackLinLog.run(int) with the number of iterations set to
the value of the environment parameter NoackLinLog.iterations.
g and the
maps corresponding to edge or node pair attributes.
g and the
maps corresponding to edge or node pair attributes.
src to dest with
the restriction that residual capacity must be at least
rq_cap along the path.
src to dest whose links
have residual capacity at least equal to rq_cap, or null
if no path can be found.
src and dest, or
null if such path cannot be found.
rq_cap.
evtype.
cmd and returns the
command's stdout in output[0] and the command's
stderr in output[1].
src to dest
just as DijkstraAll.run(V, V, int) but also makes sure
that Dijkstra's algorithm runs to completion (that is,
creates the full tree rooted at src), thus enabling the
use of obtain() later on.
|
||||||||||
| PREV LETTER NEXT LETTER | FRAMES NO FRAMES | |||||||||