Magentix2
2.1.1
|
Public Member Functions | |
DialogueGraph (ArrayList< ArgNode > nodes) | |
DialogueGraph () | |
ArrayList< ArgNode > | getNodes () |
void | addNode (ArgNode newNode) |
void | removeNode (ArgNode oldNode) |
void | setNodes (ArrayList< ArgNode > newNodes) |
ArgNode | getRoot () |
int | size () |
boolean | contains (long argID) |
ArgNode | getNode (long argID) |
ArrayList< ArgNode > | getNodes (long argID) |
int | distanceToFinal (long argID) throws Exception |
int | distanceToFinal (ArgNode argNode) throws Exception |
Implementation of the concept DialogueGraph
Definition at line 15 of file DialogueGraph.java.
es.upv.dsic.gti_ia.argAgents.knowledgeResources.DialogueGraph.DialogueGraph | ( | ArrayList< ArgNode > | nodes | ) |
Definition at line 31 of file DialogueGraph.java.
{ this.nodes = nodes; }
Definition at line 35 of file DialogueGraph.java.
{
nodes = new ArrayList<ArgNode>();
}
Definition at line 46 of file DialogueGraph.java.
{ nodes.add(newNode); }
boolean es.upv.dsic.gti_ia.argAgents.knowledgeResources.DialogueGraph.contains | ( | long | argID | ) |
Definition at line 75 of file DialogueGraph.java.
{ Iterator<ArgNode> iter=nodes.iterator(); while(iter.hasNext()){ ArgNode argNode=iter.next(); if(argNode.getArgCaseID()==argID) return true; } return false; }
int es.upv.dsic.gti_ia.argAgents.knowledgeResources.DialogueGraph.distanceToFinal | ( | long | argID | ) | throws Exception |
Definition at line 104 of file DialogueGraph.java.
{ int argPos=-1; int distance=0; for(int i=0;i<nodes.size();i++){ if(nodes.get(i).getArgCaseID()==argID){ argPos=i; break; } } for(int j=argPos;j<nodes.size();j++){ if(nodes.get(j).getNodeType()==NodeType.AGREE) break; distance++; } return distance; }
int es.upv.dsic.gti_ia.argAgents.knowledgeResources.DialogueGraph.distanceToFinal | ( | ArgNode | argNode | ) | throws Exception |
Definition at line 121 of file DialogueGraph.java.
{ int argPos=-1; int distance=0; for(int i=0;i<nodes.size();i++){ if(nodes.get(i).equals(argNode)){ argPos=i; break; } } for(int j=argPos;j<nodes.size();j++){ if(nodes.get(j).getNodeType()==NodeType.AGREE) break; distance++; } return distance; }
Definition at line 85 of file DialogueGraph.java.
{ for(int i=0;i<nodes.size();i++) if(nodes.get(i).getArgCaseID()==argID) return nodes.get(i); return null; }
Definition at line 41 of file DialogueGraph.java.
{
return nodes;
}
ArrayList<ArgNode> es.upv.dsic.gti_ia.argAgents.knowledgeResources.DialogueGraph.getNodes | ( | long | argID | ) |
Definition at line 93 of file DialogueGraph.java.
{ ArrayList<ArgNode> argN = null; for(int i=0;i<nodes.size();i++) if(nodes.get(i).getArgCaseID() == argID){ if (argN == null) argN = new ArrayList<ArgNode>(); argN.add(nodes.get(i)); } return argN; }
Definition at line 61 of file DialogueGraph.java.
{ Iterator<ArgNode> iter=nodes.iterator(); while(iter.hasNext()){ ArgNode argNode=iter.next(); if(argNode.getNodeType()==NodeType.FIRST) return argNode; } return null; }
Definition at line 51 of file DialogueGraph.java.
{ nodes.remove(oldNode); }
void es.upv.dsic.gti_ia.argAgents.knowledgeResources.DialogueGraph.setNodes | ( | ArrayList< ArgNode > | newNodes | ) |
Definition at line 56 of file DialogueGraph.java.
{ nodes = newNodes; }
Definition at line 71 of file DialogueGraph.java.
{
return nodes.size();
}