public class KahinaMemDAG extends KahinaDAG
| Modifier and Type | Field and Description |
|---|---|
protected java.util.Set<java.lang.Integer> |
collapsed |
protected java.util.Map<java.lang.Integer,java.lang.String> |
edgeLabels |
protected java.util.Map<java.lang.Integer,java.lang.Integer> |
endNodes |
protected java.util.Map<java.lang.Integer,java.util.List<java.lang.Integer>> |
incomingEdges |
protected int |
nextEdgeID |
protected int |
nextNodeID |
protected java.util.Map<java.lang.Integer,java.lang.String> |
nodeCaptions |
protected java.util.Map<java.lang.Integer,java.util.List<java.lang.Integer>> |
outgoingEdges |
protected java.util.Set<java.lang.Integer> |
roots |
protected java.util.Map<java.lang.Integer,java.lang.Integer> |
startNodes |
protected java.util.Map<java.lang.Integer,java.lang.Integer> |
status |
needsUpdate| Constructor and Description |
|---|
KahinaMemDAG() |
| Modifier and Type | Method and Description |
|---|---|
void |
addEdge(int edgeID,
int start,
int end,
java.lang.String label) |
int |
addEdge(int start,
int end,
java.lang.String label) |
void |
addNode(int id,
java.lang.String caption,
int nodeStatus) |
int |
addNode(java.lang.String caption,
int nodeStatus) |
void |
collapse(int nodeID) |
void |
decollapse(int nodeID) |
void |
decollapseAll() |
java.util.List<java.lang.Integer> |
findShortestPathFromRoot(int nodeID) |
java.lang.Iterable<java.lang.Integer> |
getEdgeIDIterator() |
java.lang.String |
getEdgeLabel(int edgeID) |
int |
getEndNode(int edgeID) |
java.util.List<java.lang.Integer> |
getIncomingEdges(int nodeID) |
protected int |
getNextFreeEdgeID() |
protected int |
getNextFreeNodeID() |
java.lang.String |
getNodeCaption(int nodeID) |
java.lang.Iterable<java.lang.Integer> |
getNodeIDIterator() |
int |
getNodeStatus(int nodeID) |
java.util.List<java.lang.Integer> |
getOutgoingEdges(int nodeID) |
java.util.Set<java.lang.Integer> |
getRoots() |
int |
getSize() |
int |
getStartNode(int edgeID) |
java.util.ArrayList<java.lang.Integer> |
getVisibleChildren(int nodeID) |
java.util.List<java.lang.Integer> |
getVisibleParents(int nodeID) |
static KahinaDAG |
importXML(org.w3c.dom.Document dom) |
boolean |
isCollapsed(int nodeID) |
boolean |
nodeIsVisible(int nodeID) |
void |
setEdgeLabel(int edgeID,
java.lang.String label) |
void |
setEndNode(int edgeID,
int endNode) |
void |
setNodeCaption(int nodeID,
java.lang.String caption) |
void |
setNodeStatus(int nodeID,
int newStatus) |
void |
setStartNode(int edgeID,
int startNode) |
addEdgeNoDuplicates, addEdgeNoDuplicates, exportXML, getEdgeBetween, toggleCollapseneedsUpdate, requireUpdateprotected java.util.Set<java.lang.Integer> roots
protected java.util.Map<java.lang.Integer,java.util.List<java.lang.Integer>> incomingEdges
protected java.util.Map<java.lang.Integer,java.util.List<java.lang.Integer>> outgoingEdges
protected java.util.Map<java.lang.Integer,java.lang.String> nodeCaptions
protected java.util.Map<java.lang.Integer,java.lang.Integer> status
protected java.util.Set<java.lang.Integer> collapsed
protected java.util.Map<java.lang.Integer,java.lang.String> edgeLabels
protected java.util.Map<java.lang.Integer,java.lang.Integer> startNodes
protected java.util.Map<java.lang.Integer,java.lang.Integer> endNodes
protected int nextNodeID
protected int nextEdgeID
public void addEdge(int edgeID,
int start,
int end,
java.lang.String label)
public int addEdge(int start,
int end,
java.lang.String label)
public void addNode(int id,
java.lang.String caption,
int nodeStatus)
public int addNode(java.lang.String caption,
int nodeStatus)
public void decollapse(int nodeID)
decollapse in class KahinaDAGpublic void decollapseAll()
decollapseAll in class KahinaDAGpublic java.lang.String getEdgeLabel(int edgeID)
getEdgeLabel in class KahinaDAGpublic java.util.List<java.lang.Integer> getIncomingEdges(int nodeID)
getIncomingEdges in class KahinaDAGpublic java.util.List<java.lang.Integer> getVisibleParents(int nodeID)
getVisibleParents in class KahinaDAGpublic java.lang.String getNodeCaption(int nodeID)
getNodeCaption in class KahinaDAGpublic int getNodeStatus(int nodeID)
getNodeStatus in class KahinaDAGpublic java.util.List<java.lang.Integer> getOutgoingEdges(int nodeID)
getOutgoingEdges in class KahinaDAGpublic java.util.ArrayList<java.lang.Integer> getVisibleChildren(int nodeID)
getVisibleChildren in class KahinaDAGpublic boolean nodeIsVisible(int nodeID)
public boolean isCollapsed(int nodeID)
isCollapsed in class KahinaDAGpublic void setEdgeLabel(int edgeID,
java.lang.String label)
setEdgeLabel in class KahinaDAGpublic void setNodeCaption(int nodeID,
java.lang.String caption)
setNodeCaption in class KahinaDAGpublic void setNodeStatus(int nodeID,
int newStatus)
setNodeStatus in class KahinaDAGprotected int getNextFreeNodeID()
protected int getNextFreeEdgeID()
public static KahinaDAG importXML(org.w3c.dom.Document dom)
public int getEndNode(int edgeID)
getEndNode in class KahinaDAGpublic int getStartNode(int edgeID)
getStartNode in class KahinaDAGpublic void setEndNode(int edgeID,
int endNode)
setEndNode in class KahinaDAGpublic void setStartNode(int edgeID,
int startNode)
setStartNode in class KahinaDAGpublic java.lang.Iterable<java.lang.Integer> getEdgeIDIterator()
getEdgeIDIterator in class KahinaDAGpublic java.lang.Iterable<java.lang.Integer> getNodeIDIterator()
getNodeIDIterator in class KahinaDAGpublic java.util.Set<java.lang.Integer> getRoots()
public java.util.List<java.lang.Integer> findShortestPathFromRoot(int nodeID)
findShortestPathFromRoot in class KahinaDAG