Uses of Package
solvers.queueingnet.treeAlgorithms
Packages that use solvers.queueingnet.treeAlgorithms
Package
Description
Tree based exact algorithms of JMVA: TreeMVA and TreeConvolution, which reduce the complexity of the exact solution of large closed models.
TreeMVA algorithm of JMVA, the tree based version of the exact Mean Value Analysis.
TreeConvolution algorithm of JMVA, the tree based version of the convolution algorithm.
-
Classes in solvers.queueingnet.treeAlgorithms used by solvers.queueingnet.treeAlgorithmsClassDescriptionImplements functionality related to class coverage.Enum to represent the 3 types of class coverages: fully-covered, partially-covered and non-covered, as defined in the LamLien83 paper.Abstract class representing complexity evaluator for calculating the complexity of a tree algorithm if it were to be run on a given tree representing a network.Internal class for storing and comparing time and space complexities.Class representing a tree node.Wrapper class for printing to console.Enum for different tree planting approaches.Class for printing trees to console.
-
Classes in solvers.queueingnet.treeAlgorithms used by solvers.queueingnet.treeAlgorithms.tmvaClassDescriptionImplements functionality related to class coverage.Abstract class representing complexity evaluator for calculating the complexity of a tree algorithm if it were to be run on a given tree representing a network.Internal class for storing and comparing time and space complexities.Class representing a tree node.Tree traverser abstract class which implements generic single-threaded tree traversal, leaving the actual node computations to the extending class.Tree traverser abstract class which implements generic multi-threaded tree traversal, leaving the actual node computations to the extending class.
-
Classes in solvers.queueingnet.treeAlgorithms used by solvers.queueingnet.treeAlgorithms.treeConvolutionClassDescriptionImplements functionality related to class coverage.Abstract class representing complexity evaluator for calculating the complexity of a tree algorithm if it were to be run on a given tree representing a network.Internal class for storing and comparing time and space complexities.Class representing a tree node.Class responsible for the tree planting phase of the Tree Convolution algorithm.Tree traverser abstract class which implements generic single-threaded tree traversal, leaving the actual node computations to the extending class.Tree traverser abstract class which implements generic multi-threaded tree traversal, leaving the actual node computations to the extending class.