public abstract class KahinaDAG extends KahinaObject
needsUpdate
Constructor and Description |
---|
KahinaDAG() |
Modifier and Type | Method and Description |
---|---|
abstract void |
addEdge(int edgeID,
int start,
int end,
java.lang.String label) |
abstract int |
addEdge(int start,
int end,
java.lang.String label) |
void |
addEdgeNoDuplicates(int edgeID,
int start,
int end,
java.lang.String label) |
int |
addEdgeNoDuplicates(int start,
int end,
java.lang.String label) |
abstract void |
addNode(int id,
java.lang.String caption,
int nodeStatus) |
abstract int |
addNode(java.lang.String caption,
int nodeStatus) |
abstract void |
collapse(int nodeID) |
abstract void |
decollapse(int nodeID) |
abstract void |
decollapseAll() |
java.lang.String |
exportXML() |
abstract java.util.List<java.lang.Integer> |
findShortestPathFromRoot(int nodeID) |
int |
getEdgeBetween(int startID,
int endID) |
abstract java.lang.Iterable<java.lang.Integer> |
getEdgeIDIterator() |
abstract java.lang.String |
getEdgeLabel(int edgeID) |
abstract int |
getEndNode(int edgeID) |
abstract java.util.List<java.lang.Integer> |
getIncomingEdges(int nodeID) |
abstract java.lang.String |
getNodeCaption(int nodeID) |
abstract java.lang.Iterable<java.lang.Integer> |
getNodeIDIterator() |
abstract int |
getNodeStatus(int nodeID) |
abstract java.util.List<java.lang.Integer> |
getOutgoingEdges(int nodeID) |
abstract java.util.Set<java.lang.Integer> |
getRoots() |
abstract int |
getSize() |
abstract int |
getStartNode(int edgeID) |
abstract java.util.List<java.lang.Integer> |
getVisibleChildren(int nodeID) |
abstract java.util.List<java.lang.Integer> |
getVisibleParents(int nodeID) |
abstract boolean |
isCollapsed(int nodeID) |
abstract void |
setEdgeLabel(int edgeID,
java.lang.String label) |
abstract void |
setEndNode(int edgeID,
int endNode) |
abstract void |
setNodeCaption(int nodeID,
java.lang.String caption) |
abstract void |
setNodeStatus(int nodeID,
int status) |
abstract void |
setStartNode(int edgeID,
int startNode) |
void |
toggleCollapse(int nodeID) |
needsUpdate, requireUpdate
public abstract void addNode(int id, java.lang.String caption, int nodeStatus)
public abstract int addNode(java.lang.String caption, int nodeStatus)
public abstract void addEdge(int edgeID, int start, int end, java.lang.String label)
public abstract int addEdge(int start, int end, java.lang.String label)
public void addEdgeNoDuplicates(int edgeID, int start, int end, java.lang.String label)
public int addEdgeNoDuplicates(int start, int end, java.lang.String label)
public abstract void decollapseAll()
public abstract void decollapse(int nodeID)
public abstract void collapse(int nodeID)
public abstract boolean isCollapsed(int nodeID)
public abstract java.util.List<java.lang.Integer> getOutgoingEdges(int nodeID)
public abstract java.util.List<java.lang.Integer> getVisibleParents(int nodeID)
public abstract java.util.List<java.lang.Integer> getIncomingEdges(int nodeID)
public int getEdgeBetween(int startID, int endID)
public abstract java.util.List<java.lang.Integer> getVisibleChildren(int nodeID)
public abstract int getNodeStatus(int nodeID)
public abstract void setNodeStatus(int nodeID, int status)
public abstract java.lang.String getEdgeLabel(int edgeID)
public abstract void setEdgeLabel(int edgeID, java.lang.String label)
public abstract int getStartNode(int edgeID)
public abstract void setStartNode(int edgeID, int startNode)
public abstract int getEndNode(int edgeID)
public abstract void setEndNode(int edgeID, int endNode)
public abstract java.lang.String getNodeCaption(int nodeID)
public abstract void setNodeCaption(int nodeID, java.lang.String caption)
public abstract int getSize()
public abstract java.lang.Iterable<java.lang.Integer> getNodeIDIterator()
public abstract java.lang.Iterable<java.lang.Integer> getEdgeIDIterator()
public abstract java.util.Set<java.lang.Integer> getRoots()
public abstract java.util.List<java.lang.Integer> findShortestPathFromRoot(int nodeID)
public void toggleCollapse(int nodeID)
public java.lang.String exportXML()