|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Disjoinness | |
---|---|
bcds.phison.ra | The routing algorithm (ra) package defines the interface expected by the Phison simulator and implements several well-known routing algorithms, such as Dijkstra, WSP and SWP. |
Uses of Disjoinness in bcds.phison.ra |
---|
Methods in bcds.phison.ra that return Disjoinness | |
---|---|
static Disjoinness |
Disjoinness.valueOf(java.lang.String name)
Returns the enum constant of this type with the specified name. |
static Disjoinness[] |
Disjoinness.values()
Returns an array containing the constants of this enum type, in the order they are declared. |
Constructors in bcds.phison.ra with parameters of type Disjoinness | |
---|---|
ProtDPP_MinCost(TED<V,E> ted,
Environ env,
Disjoinness dj)
Creates a new instance with the disjointness type set to dj . |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |