Uses of Interface
unbbayes.prs.INode

Packages that use INode

unbbayes.prs
unbbayes.prs.bn
unbbayes.prs.extension
unbbayes.prs.hybridbn
unbbayes.prs.id
unbbayes.util.dseparation
unbbayes.util.dseparation.impl

Uses of INode in unbbayes.prs

Classes in unbbayes.prs that implement INode

class

Node A class representing a generic node containing graphical/visual information.

Methods in unbbayes.prs that return types with arguments of type INode

List<INode>	Node.getAdjacentNodes()
List<INode>	INode.getAdjacentNodes() Obtains a list of adjacent nodes.
List<INode>	Node.getChildNodes()
List<INode>	INode.getChildNodes() Obtains a list of children.
List<INode>	Node.getParentNodes()
List<INode>	INode.getParentNodes() Obtains a list of parents.

Methods in unbbayes.prs with parameters of type INode

void	Node.addChildNode(INode child)
void	INode.addChildNode(INode child) Adds a child to this node
void	Node.addParentNode(INode parent)
void	INode.addParentNode(INode parent) Add a parent to this node
void	Node.removeChildNode(INode child)
void	INode.removeChildNode(INode child) Removes a child from this node
void	Node.removeParentNode(INode parent)
void	INode.removeParentNode(INode parent) Removes a parent from this node

Method parameters in unbbayes.prs with type arguments of type INode

void	Node.setChildNodes(List<INode> children)
void	INode.setChildNodes(List<INode> children) Sets a new list of children.
void	Node.setParentNodes(List<INode> parents)
void	INode.setParentNodes(List<INode> parents) Sets a new list of parents.

Uses of INode in unbbayes.prs.bn

Classes in unbbayes.prs.bn that implement INode

class	LearningNode Classe que define um variÔøΩvel de um banco de casos, as variÔøΩveis possuem um vetor de pais(do tipo LearningNode), um veto de estados (do tipo String), um vetor de predecessores, que sÔøΩo os candidatos a pais (do tipo LearningNode), um nome e um numero mÔøΩximo de pais.
class	ProbabilisticNode Represents probabilistic variable.
class	TreeVariable Abstract class for variables that will be shown in the tree of nodes and states with their probabilities in the compilation panel.

Methods in unbbayes.prs.bn that return INode

INode	PotentialTable.getVariableAt(int index)
INode	IProbabilityFunction.getVariableAt(int index) Obtains a variable (node) associated with this function

Methods in unbbayes.prs.bn with parameters of type INode

void	PotentialTable.addVariable(INode variavel)
void	IProbabilityFunction.addVariable(INode variable) Inserts a variable into function.
void	ProbabilisticTable.removeVariable(INode variavel) Retira a variÔøΩvel da tabela.
abstract void	PotentialTable.removeVariable(INode variable)
void	IProbabilityFunction.removeVariable(INode variable) Remove the variable from this function.
void	ProbabilisticTable.removeVariable(INode variable, boolean normalize) Remove the variable of the table.
abstract void	PotentialTable.removeVariable(INode variable, boolean normalize) Remove the variable of the table.
void	IProbabilityFunction.removeVariable(INode variable, boolean update) Remove the variable from this function.
void	PotentialTable.setVariableAt(int index, INode node)
void	IProbabilityFunction.setVariableAt(int index, INode node) Inserts a variable into position

Uses of INode in unbbayes.prs.extension

Subinterfaces of INode in unbbayes.prs.extension

interface

IPluginNode A plugin node must extend this class, so that UnBBayes can understand that currently selected node shall have special treatment.

Uses of INode in unbbayes.prs.hybridbn

Classes in unbbayes.prs.hybridbn that implement INode

class

ContinuousNode

Uses of INode in unbbayes.prs.id

Classes in unbbayes.prs.id that implement INode

class	DecisionNode Variavel de decisao
class	UtilityNode This class represents the utility node.

Methods in unbbayes.prs.id with parameters of type INode

void	UtilityTable.removeVariable(INode variavel) Retira a variÔøΩvel da tabela.
void	UtilityTable.removeVariable(INode variable, boolean normalize)

Uses of INode in unbbayes.util.dseparation

Methods in unbbayes.util.dseparation that return types with arguments of type INode

Set<INode>

IDSeparationUtility.getAllDSeparatedNodes(Set<INode> consideredNodes, Set<INode> from, Set<INode> separators) Obtains all nodes within graph which is d-separated from the set "from" given the separators.

Method parameters in unbbayes.util.dseparation with type arguments of type INode

Set<INode>	IDSeparationUtility.getAllDSeparatedNodes(Set<INode> consideredNodes, Set<INode> from, Set<INode> separators) Obtains all nodes within graph which is d-separated from the set "from" given the separators.
Set<INode>	IDSeparationUtility.getAllDSeparatedNodes(Set<INode> consideredNodes, Set<INode> from, Set<INode> separators) Obtains all nodes within graph which is d-separated from the set "from" given the separators.
Set<INode>	IDSeparationUtility.getAllDSeparatedNodes(Set<INode> consideredNodes, Set<INode> from, Set<INode> separators) Obtains all nodes within graph which is d-separated from the set "from" given the separators.
boolean	IDSeparationUtility.isDSeparated(Set<INode> consideredNodes, Set<INode> from, Set<INode> to, Set<INode> separators) Checks if the nodes within "from" are d-separated from nodes from "to", given a set of "separators".
boolean	IDSeparationUtility.isDSeparated(Set<INode> consideredNodes, Set<INode> from, Set<INode> to, Set<INode> separators) Checks if the nodes within "from" are d-separated from nodes from "to", given a set of "separators".
boolean	IDSeparationUtility.isDSeparated(Set<INode> consideredNodes, Set<INode> from, Set<INode> to, Set<INode> separators) Checks if the nodes within "from" are d-separated from nodes from "to", given a set of "separators".
boolean	IDSeparationUtility.isDSeparated(Set<INode> consideredNodes, Set<INode> from, Set<INode> to, Set<INode> separators) Checks if the nodes within "from" are d-separated from nodes from "to", given a set of "separators".

Uses of INode in unbbayes.util.dseparation.impl

Methods in unbbayes.util.dseparation.impl that return types with arguments of type INode

Map<INode,Set<INode>>	MSeparationUtility.buildClosedAdjacentNodeMap(Set<INode> allKeys) Builds a map containing a temporally reference to all adjacent nodes, given a key node.
Map<INode,Set<INode>>	MSeparationUtility.buildClosedAdjacentNodeMap(Set<INode> allKeys) Builds a map containing a temporally reference to all adjacent nodes, given a key node.
Set<INode>	MSeparationUtility.getAllAncestors(Set<INode> nodes) Method to get all ancestors of a given set of nodes.
protected Set<INode>	MSeparationUtility.getAllAncestors(Set<INode> nodes, Set<INode> nodesToStop) Method to get all ancestors of a given set of nodes.
Set<INode>	MSeparationUtility.getAllDescendants(Set<INode> nodes) Method to get all descendants of a given set of nodes.
protected Set<INode>	MSeparationUtility.getAllDescendants(Set<INode> nodes, Set<INode> nodesToStop, MSeparationUtility.MSeparationUtilityNodeVisitor visitor) Method to get all descendants of a given set of nodes.
Set<INode>	MSeparationUtilityIncludingSeparators.getAllDSeparatedNodes(Set<INode> consideredNodes, Set<INode> from, Set<INode> separators)
Set<INode>	MSeparationUtility.getAllDSeparatedNodes(Set<INode> consideredNodes, Set<INode> from, Set<INode> separators)
Set<List<INode>>	MSeparationUtility.getRoutes(INode from, INode to) Obtains a set of path/routes between two nodes, including themselves.
Set<List<INode>>	MSeparationUtility.getRoutes(INode from, INode to, Map<INode,Set<INode>> closedAdjacentNodeMap) Obtains a set of path/routes between two nodes, including themselves.
Set<List<INode>>	MSeparationUtility.getRoutes(INode from, INode to, Map<INode,Set<INode>> closedAdjacentNodeMap, Set<INode> nodesNotToContain, int maxRoutes) Obtains a set of path/routes between two nodes, including themselves.
Set<List<INode>>	MSeparationUtility.getRoutes(INode from, Set<INode> setTo, Map<INode,Set<INode>> closedAdjacentNodeMap, Set<INode> nodesNotToContain, int maxRoutes) Obtains a set of path/routes between two nodes, including themselves.
Map<INode,Set<INode>>	MSeparationUtility.makeItMoral(Map<INode,Set<INode>> closedAdjacentNodeMap) If a node has a common child, make them adjacent (marry them - this is something moral).
Map<INode,Set<INode>>	MSeparationUtility.makeItMoral(Map<INode,Set<INode>> closedAdjacentNodeMap) If a node has a common child, make them adjacent (marry them - this is something moral).

Methods in unbbayes.util.dseparation.impl with parameters of type INode

Set<List<INode>>	MSeparationUtility.getRoutes(INode from, INode to) Obtains a set of path/routes between two nodes, including themselves.
Set<List<INode>>	MSeparationUtility.getRoutes(INode from, INode to, Map<INode,Set<INode>> closedAdjacentNodeMap) Obtains a set of path/routes between two nodes, including themselves.
Set<List<INode>>	MSeparationUtility.getRoutes(INode from, INode to, Map<INode,Set<INode>> closedAdjacentNodeMap, Set<INode> nodesNotToContain, int maxRoutes) Obtains a set of path/routes between two nodes, including themselves.
Set<List<INode>>	MSeparationUtility.getRoutes(INode from, Set<INode> setTo, Map<INode,Set<INode>> closedAdjacentNodeMap, Set<INode> nodesNotToContain, int maxRoutes) Obtains a set of path/routes between two nodes, including themselves.

Method parameters in unbbayes.util.dseparation.impl with type arguments of type INode

Map<INode,Set<INode>>	MSeparationUtility.buildClosedAdjacentNodeMap(Set<INode> allKeys) Builds a map containing a temporally reference to all adjacent nodes, given a key node.
Set<INode>	MSeparationUtility.getAllAncestors(Set<INode> nodes) Method to get all ancestors of a given set of nodes.
protected Set<INode>	MSeparationUtility.getAllAncestors(Set<INode> nodes, Set<INode> nodesToStop) Method to get all ancestors of a given set of nodes.
protected Set<INode>	MSeparationUtility.getAllAncestors(Set<INode> nodes, Set<INode> nodesToStop) Method to get all ancestors of a given set of nodes.
Set<INode>	MSeparationUtility.getAllDescendants(Set<INode> nodes) Method to get all descendants of a given set of nodes.
protected Set<INode>	MSeparationUtility.getAllDescendants(Set<INode> nodes, Set<INode> nodesToStop, MSeparationUtility.MSeparationUtilityNodeVisitor visitor) Method to get all descendants of a given set of nodes.
protected Set<INode>	MSeparationUtility.getAllDescendants(Set<INode> nodes, Set<INode> nodesToStop, MSeparationUtility.MSeparationUtilityNodeVisitor visitor) Method to get all descendants of a given set of nodes.
Set<INode>	MSeparationUtilityIncludingSeparators.getAllDSeparatedNodes(Set<INode> consideredNodes, Set<INode> from, Set<INode> separators)
Set<INode>	MSeparationUtilityIncludingSeparators.getAllDSeparatedNodes(Set<INode> consideredNodes, Set<INode> from, Set<INode> separators)
Set<INode>	MSeparationUtilityIncludingSeparators.getAllDSeparatedNodes(Set<INode> consideredNodes, Set<INode> from, Set<INode> separators)
Set<INode>	MSeparationUtility.getAllDSeparatedNodes(Set<INode> consideredNodes, Set<INode> from, Set<INode> separators)
Set<INode>	MSeparationUtility.getAllDSeparatedNodes(Set<INode> consideredNodes, Set<INode> from, Set<INode> separators)
Set<INode>	MSeparationUtility.getAllDSeparatedNodes(Set<INode> consideredNodes, Set<INode> from, Set<INode> separators)
Set<List<INode>>	MSeparationUtility.getRoutes(INode from, INode to, Map<INode,Set<INode>> closedAdjacentNodeMap) Obtains a set of path/routes between two nodes, including themselves.
Set<List<INode>>	MSeparationUtility.getRoutes(INode from, INode to, Map<INode,Set<INode>> closedAdjacentNodeMap) Obtains a set of path/routes between two nodes, including themselves.
Set<List<INode>>	MSeparationUtility.getRoutes(INode from, INode to, Map<INode,Set<INode>> closedAdjacentNodeMap, Set<INode> nodesNotToContain, int maxRoutes) Obtains a set of path/routes between two nodes, including themselves.
Set<List<INode>>	MSeparationUtility.getRoutes(INode from, INode to, Map<INode,Set<INode>> closedAdjacentNodeMap, Set<INode> nodesNotToContain, int maxRoutes) Obtains a set of path/routes between two nodes, including themselves.
Set<List<INode>>	MSeparationUtility.getRoutes(INode from, INode to, Map<INode,Set<INode>> closedAdjacentNodeMap, Set<INode> nodesNotToContain, int maxRoutes) Obtains a set of path/routes between two nodes, including themselves.
Set<List<INode>>	MSeparationUtility.getRoutes(INode from, Set<INode> setTo, Map<INode,Set<INode>> closedAdjacentNodeMap, Set<INode> nodesNotToContain, int maxRoutes) Obtains a set of path/routes between two nodes, including themselves.
Set<List<INode>>	MSeparationUtility.getRoutes(INode from, Set<INode> setTo, Map<INode,Set<INode>> closedAdjacentNodeMap, Set<INode> nodesNotToContain, int maxRoutes) Obtains a set of path/routes between two nodes, including themselves.
Set<List<INode>>	MSeparationUtility.getRoutes(INode from, Set<INode> setTo, Map<INode,Set<INode>> closedAdjacentNodeMap, Set<INode> nodesNotToContain, int maxRoutes) Obtains a set of path/routes between two nodes, including themselves.
Set<List<INode>>	MSeparationUtility.getRoutes(INode from, Set<INode> setTo, Map<INode,Set<INode>> closedAdjacentNodeMap, Set<INode> nodesNotToContain, int maxRoutes) Obtains a set of path/routes between two nodes, including themselves.
boolean	MSeparationUtilityIncludingSeparators.isDSeparated(Set<INode> consideredNodes, Set<INode> from, Set<INode> to, Set<INode> separators)
boolean	MSeparationUtilityIncludingSeparators.isDSeparated(Set<INode> consideredNodes, Set<INode> from, Set<INode> to, Set<INode> separators)
boolean	MSeparationUtilityIncludingSeparators.isDSeparated(Set<INode> consideredNodes, Set<INode> from, Set<INode> to, Set<INode> separators)
boolean	MSeparationUtilityIncludingSeparators.isDSeparated(Set<INode> consideredNodes, Set<INode> from, Set<INode> to, Set<INode> separators)
boolean	MSeparationUtility.isDSeparated(Set<INode> consideredNodes, Set<INode> from, Set<INode> to, Set<INode> separators) Checks if the nodes within "from" are m-separated from nodes from "to", given a set of "separators".
boolean	MSeparationUtility.isDSeparated(Set<INode> consideredNodes, Set<INode> from, Set<INode> to, Set<INode> separators) Checks if the nodes within "from" are m-separated from nodes from "to", given a set of "separators".
boolean	MSeparationUtility.isDSeparated(Set<INode> consideredNodes, Set<INode> from, Set<INode> to, Set<INode> separators) Checks if the nodes within "from" are m-separated from nodes from "to", given a set of "separators".
boolean	MSeparationUtility.isDSeparated(Set<INode> consideredNodes, Set<INode> from, Set<INode> to, Set<INode> separators) Checks if the nodes within "from" are m-separated from nodes from "to", given a set of "separators".
Map<INode,Set<INode>>	MSeparationUtility.makeItMoral(Map<INode,Set<INode>> closedAdjacentNodeMap) If a node has a common child, make them adjacent (marry them - this is something moral).
Map<INode,Set<INode>>	MSeparationUtility.makeItMoral(Map<INode,Set<INode>> closedAdjacentNodeMap) If a node has a common child, make them adjacent (marry them - this is something moral).