gov.sandia.cognition.graph.inference

Interface GraphWrappingEnergyFunction.PotentialHandler<LabelType,NodeNameType>

Type Parameters:

LabelType - The type for labels assigned to nodes

NodeNameType - The type for names of nodes

Enclosing class:

GraphWrappingEnergyFunction<LabelType,NodeNameType>

public static interface GraphWrappingEnergyFunction.PotentialHandler<LabelType,NodeNameType>

This interface defines the problem-specific methods this class requires as input

Method Summary

Modifier and Type	Method and Description
double	getPairwisePotential(DirectedNodeEdgeGraph<NodeNameType> graph, int edgeId, LabelType ilabel, LabelType jlabel) Provide the pairwise potential for the specified edge
java.util.List<LabelType>	getPossibleLabels(DirectedNodeEdgeGraph<NodeNameType> graph, int nodeId) Get the possible labels for the specified node
double	getUnaryPotential(DirectedNodeEdgeGraph<NodeNameType> graph, int i, LabelType label, LabelType assignedLabel) Provide the unary potential for the specified node

Method Detail

getPairwisePotential

double getPairwisePotential(DirectedNodeEdgeGraph<NodeNameType> graph,
                            int edgeId,
                            LabelType ilabel,
                            LabelType jlabel)

Provide the pairwise potential for the specified edge

Parameters:

graph - The graph the edge is from

edgeId - The id of the edge whose potential is wanted

ilabel - The label being considered for the first node on the edge

jlabel - The label being considered for the second node on the edge

Returns:

the pairwise potential

getUnaryPotential

double getUnaryPotential(DirectedNodeEdgeGraph<NodeNameType> graph,
                         int i,
                         LabelType label,
                         LabelType assignedLabel)

Provide the unary potential for the specified node

Parameters:

graph - The graph the node is from

i - The id of the node whose potential is wanted

label - The label being considered for the node

assignedLabel - the label assigned to the node (null if none assigned via setLabel)

Returns:

the unary potential

getPossibleLabels

java.util.List<LabelType> getPossibleLabels(DirectedNodeEdgeGraph<NodeNameType> graph,
                                            int nodeId)

Get the possible labels for the specified node

Parameters:

graph - The graph the node is from

nodeId - The id of the node in the graph

Returns:

the possible labels for that node